International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 29 - Number 3 |
Year of Publication: 2011 |
Authors: Dr. K.V.Suryanarayana Rao, Prof. V. Sreenivansan |
10.5120/3542-4851 |
Dr. K.V.Suryanarayana Rao, Prof. V. Sreenivansan . The Split Domination in Arithmetic Graphs. International Journal of Computer Applications. 29, 3 ( September 2011), 46-49. DOI=10.5120/3542-4851
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 Vm graph as r+1,where m is a positive integer and m =p_1^(a_1 ).p_2^(a_2 )……p_r^(a_r ) is the canonical representation, where p_1,p_2,…,p_r are distinct primes and a_i^' s>1.