Total Domination Edge Critical Graphs With Minimum Diameter
Document Type
Article
Publication Date
1-1-2003
Description
Denote the total domination number of a graph G by γt(G). A graph G is said to be total domination edge critical, or simply γt-critical, if γt(G + e) < γt(G) for each edge e ∈ E(Ḡ). For 3 t-critical graphs G, that is, γt-critical graphs with γt(G) = 3, the diameter of G is either 2 or 3. We study the 3t-critical graphs G with diam G = 2.
Citation Information
Van Der Merwe, L. C.; Mynhardt, C. M.; and Haynes, T. W.. 2003. Total Domination Edge Critical Graphs With Minimum Diameter. Ars Combinatoria. Vol.66 79-96. ISSN: 0381-7032