1, Semiglobal Cototal Domination on Graphs

T. Nicholas, T. Sheeba Helen

Abstract: A subset D of vertices of a connected graph G is called a semiglobal cototal dominating set if D is a dominating set for G and Gsc and has no isolated vertices in G, where Gsc is the semi complementary graph of G. The semiglobal cototal domination number is the minimum cardinality of a semiglobal cototal dominating set of G and is denoted by sgcot (G). In this paper we initiate a study of this new parameter sgcot (G). Some bounds on this parameter are obtained and their exact values for some standard graphs are established.

Keywords: Semicomplete graph, global cototal domination number, semicomplementary graph, semiglobal cototal domination number

How to Cite?: T. Nicholas, T. Sheeba Helen, "1, Semiglobal Cototal Domination on Graphs", Volume 6 Issue 1, January 2017, International Journal of Science and Research (IJSR), Pages: 2293-2295, https://www.ijsr.net/getabstract.php?paperid=ART20164180, DOI: https://dx.doi.org/10.21275/ART20164180