Complete Cototal Domination Number of a Graph
Keywords:Domination number, Total domination number, Cototal domination number, Complete cototal domination number.
Let be a graph. A set of a graph is called a total dominating set if the induced subgraph has no isolated vertices. The total domination number of G is the minimum cardinality of a total dominating set of G. A total dominating set D is said to be a complete cototal dominating set if the induced subgraph has no isolated vertices. The complete cototal domination number of G is the minimum cardinality of a complete cototal dominating set of G. In this paper, we initiate the study of complete cototal domination in graphs and present bounds and some exact values for . Also its relationship with other domination parameters are established and related two open problems are explored.
Keywords: Domination number; Total domination number; Cototal domination number; Complete cototal domination number.
© 2011 JSR Publications. ISSN: 2070-0237 (Print); 2070-0245 (Online). All rights reserved.
doi:10.3329/jsr.v3i3.7744 J. Sci. Res. 3 (3), 557-565 (2011)
How to Cite
© Journal of Scientific Research
Articles published in the "Journal of Scientific Research" are Open Access articles under a Creative Commons Attribution-ShareAlike 4.0 International license (CC BY-SA 4.0). This license permits use, distribution and reproduction in any medium, provided the original work is properly cited and initial publication in this journal. In addition to that, users must provide a link to the license, indicate if changes are made and distribute using the same license as original if the original content has been remixed, transformed or built upon.