Global Accurate Domination in Graphs

IJSRP, Volume 3, Issue 10, October 2013 Edition [ISSN 2250-3153]

Global Accurate Domination in Graphs

V.R.Kulli, M.B.Kattimani

Abstract: A dominating set D of a graph G = (V, E) is an accurate dominating set, if V–D has no dominating set of cardinality |D|.

[VIEW FULL PAPER]

[DOWNLOAD]

[Reference this Paper] [BACK]

Reference this Research Paper (copy & paste below code):

V.R.Kulli, M.B.Kattimani (2018); Global Accurate Domination in Graphs; Int J Sci Res Publ 3(10) (ISSN: 2250-3153). http://www.ijsrp.org/research-paper-1013.php?rp=P221836