The Split Domination in Arithmetic Graphs

The paper concentrates on the theory of domination in graphs. The split domination in graphs was introduced by Kulli and Janakirm [5]. In this paper; we have investigated some properties of the split domination number of an Arithmetic Graph and obtained several interesting results. The split domination of these arithmetic graphs have been studied as it enables us to construct graphs with a given split domination number in a very simple way. We have obtained an upper bound for the split domination number of the V m graph as r+1,where m is a positive integer and is the canonical representation, where are distinct primes and.