Independent Domination of Splitted Graphs
A.Nellai Murugan , A.Esakkimuthu. "Independent Domination of Splitted Graphs", International Journal of Mathematical Trends and Technology (IJMTT). V8:56-63 April 2014. ISSN:2231-5373. www.ijmttjournal.org. Published by Seventh Sense Research Group.
Abstract
A dominating set D of a splitted graph S(G) = ( V, E ) is an independent dominating set if the induced subgraph <D> has no edges. The independent domination number i[S(G)] of a graph S(G) is the minimum cardinality of an independent dominating set.
References
[1] Allan.R.B. and Laskar.R.C , On domination and independent dommination numbers of a graphs, Discrete math, 23 (1978) 73-76.
[2] Cockayane.C.J, Dawes.R.B. and Hedetniemi, Total domination in graphs, Networks, 10 (1980) pp. 211-219.
[3] Flach.P. and Volkmann.L, Estimations for the domination number of a graph, Discrete math., 80 (1990) 145-151.
[4] Harrary.F, Graph Theory, Adadison-Wesley Publishing Company Inc, USA, 1969.
[5] Hedetniemi.S.T. and Laskar.R.C, Connected domination in graphs, In B. Bollobas, editor, Graph Theory and Combinatorics, Acadamic Press, London(1984) 209-218.
[6] Kulli.V.R., Theory of domination in graphs, vishwa itrnatiional publications Gulbarga India.
[7] Nellai Murugan.A. and EsakkiMuthu.A., Domination of Complement of a Splitted Graphs, Indian Journal of Applied Research, Vol.4, issue 4, April 2014, pp. 392-394.
[8] Nellai Murugan.A. and EsakkiMuthu.A., Domination and Total Domination of Splitted Graphs, International Journal of Mathematical Archive, April 2014, (accepted).
[9] Sampathkumar.E. and Walikar.H.B, The Connected dominaiton number of a graph,J.Math.Phys.Sci., 13 (1979) 607-613.
[10] Walikar.H.B, Acharya.B.D. and Sampathkumar.E, Recent development in the theory of domination graphs, In MRI Lecture Notes in Math. Mahta Research Instit., Allahabad No.1, (1979).
Keywords
independent Domination, Splitted graph.