文章基本信息

标题：Complete Cototal Domination Number of a Graph
其他标题：Complete Cototal Domination Number of a Graph
本地全文：下载
作者：B. Basavanagoud ; S. M. Hosamani
期刊名称：Journal of Scientific Research
印刷版ISSN：2070-0237
电子版ISSN：2070-0245
出版年度：2011
卷号：3
期号：3
页码：547-555
DOI：10.3329/jsr.v3i3.7744
语种：English
出版社：Rajshahi University
摘要：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)
关键词：Mathematics;Domination number; Total domination number; Cototal domination number; Complete cototal domination number.