Properties of total domination edge-critical graphs
- Henning, Michael A.
- van der Merwe, Lucas C.
Publication date
January 2010
DOI Publisher
Elsevier B.V. ISSN
0166-218X Citation count (estimate)
3Abstract
AbstractA set S of vertices in a graph G is a total dominating set of G if every vertex of G is adjacent to some vertex in S. The minimum cardinality of a total dominating set of G is the total domination number γt(G) of G. The graph G is total domination edge critical if for every edge e in the complement of G, γt(G+e)<γt(G). We call such graphs γtEC. Properties of γtEC graphs are established
Add to ORKG