Total dominating set;
Total domination number;
Subdivided star;
Lower bound;
TREES;
NUMBER;
D O I:
10.1016/j.disc.2018.01.006
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
We give a lower bound for the number of total dominating sets of a graph together with a characterization of the extremal graphs, for trees as well as arbitrary connected graphs of given order. Moreover, we obtain a sharp lower bound involving both the order and the total domination number, and characterize the extremal graphs as well. (C) 2018 Elsevier B.V. All rights reserved.