Disjoint dominating and total dominating sets in graphs

作者：Henning Michael A; Loewenstein Christian; Rautenbach Dieter^*; Southey Justin

来源：Discrete Applied Mathematics, 2010, 158(15): 1615-1623.

DOI：10.1016/j.dam.2010.06.004

• Domination
• Total domination
• Vertex partition

It has been shown [M.A. Henning, J. Southey, A note on graphs with disjoint dominating and total dominating sets, Ars Combin. 89 (2008) 159-162] that every connected graph with minimum degree at least two that is not a cycle on five vertices has a dominating set D and a total dominating set T which are disjoint. We characterize such graphs for which D U T necessarily contains all vertices of the graph and that have no induced cycle on five vertices.

• 出版日期2010-8-6