
AbstractIt 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∪T necessarily contains all vertices of the graph and that have no induced cycle on five vertices.
Total domination, Applied Mathematics, Discrete Mathematics and Combinatorics, Vertex partition, Domination
Total domination, Applied Mathematics, Discrete Mathematics and Combinatorics, Vertex partition, Domination
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 21 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
