total domination number;
total outer-connected domination number;
unicyclic graphs;
D O I:
暂无
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
Let G = (V, E) be a graph without an isolated vertex. A set D subset of V(G) is a total dominating set if D. is dominating and the induced subgraph G[D] does not contain an isolated vertex. The total domination number of G is the minimum cardinality of a total dominating set of G. A set D subset of V(G) is a total outer-connected dominating set if D is total dominating and the induced subgraph G[V(G) - D] is a connected graph. The total outer-connected domination number of G is the minimum cardinality of a total outer-connected dominating set of G. We characterize all unicyclic graphs with equal total domination and total outer-connected domination numbers.