Cubic Graphs with Total Domatic Number at Least Two

Discussiones Mathematicae Graph Theory

Yazdanbod Sina¹  Mozaffari Sahand¹  Motiei Mohammad¹  Akbari Saieed² 

[1] Department of Computer Engineering, Sharif University of Technology;Department of Mathematics, Sharif University of Technology;

关键词: total domination;    total domatic number;    coupon coloring;    05c15;    05c69;   

DOI  :  10.7151/dmgt.1996

来源: DOAJ

【 摘 要 】

Let G be a graph with no isolated vertex. A total dominating set of G is a set S of vertices of G such that every vertex is adjacent to at least one vertex in S. The total domatic number of a graph is the maximum number of total dominating sets which partition the vertex set of G. In this paper we provide a criterion under which a cubic graph has total domatic number at least two.

【 授权许可】

Unknown