International Journal of Mathematics Trends and Technology
Volume 66 | Issue 1 | Year 2020 | Article Id. IJMTT-V66I1P527 | DOI : https://doi.org/10.14445/22315373/IJMTT-V66I1P527
Let G = (V,E) be a simple, finite, connected and undirected graph. A non-empty subset D⊆V is called a dominating set if every vertex in V-D adjacent to at least one vertex in D. The minimum cardinality taken over all the minimal dominating sets of G is called the domination number of G, denoted by γ(G). A dominating set D of V is an accurate dominating set if V-D has no dominating set of |D|. The accurate domination number γa(G) is the minimum cardinality of a minimal accurate dominating set of G. An accurate dominating set D of V is an accurate split dominating set if is disconnected. The accurate split domination number γas (G) is the minimum cardinality of a minimal accurate split dominating set of G. An accurate dominating set D of V is an accurate non-split dominating set if is connected. The accurate non-split domination number γans(G) is the minimum cardinality of a minimal accurate non-split dominating set of G. In this paper, we obtained some results on γa(G) and γans(G) of some special graph
[1] T.W. Hynes, S.T. Hedetriemi and P.J. Slater Fundamentals of Domination in Graphs, Marcel Dekkar, New York (1990).
[2] T.W. Hynes, S.T. Hedetriemi and P.J. Slater, Domination in Graph, Advanced Topic: Marcel Dekkar, New York (1998).
[3] O. Ore, Theory of Graphs, American math colloq (1962).
[4] V.R. Kulli, Advances in Domination Theory I & II Vishwa International publications, Gulbarga, Indian (2012, 2013).
[5] V.R. Kulli, College Graph Theory, Vishwa International publications, Gulbarga, Indian (2012).
[6] V.R. Kulli and B. Janakiram, The non-split domination number of a graph, Indian Journal of pure and applied mathematics (1996) 27(6), 537-542.
[7] V.R. Kulli and M.B. Kattimani, The accurate domination number of a graph, Technical Report 2000-2001 Gulbarga university, Gulbarga (2000).
[8] V.R. Kulli and B. Janakiram, The split domination number of a graph, Graph theory Notes of New York, New York Academy of science XXXII pp: 16-19.
[9] S. Arumugam and S. Ramachandran, Invitation of Graph Theory, Scitech publications, India (2010).
[10] Bordy J and Murthy V.S.R Graph Theory with Applications Mac Millan Press Landon (1976).
T. Aswini, Dr. k. Ameenal Bibi, M. Hoorulayeen, "Some Results on Accurate Split Domination And Accurate Non-Split Domination of Some Special Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 66, no. 1, pp. 212-219, 2020. Crossref, https://doi.org/10.14445/22315373/IJMTT-V66I1P527
PDF 
Abstract 
Keywords 
References 
Citation