Currently displaying 1 – 1 of 1

Showing per page

Order by Relevance | Title | Year of publication

Total domination edge critical graphs with maximum diameter

Lucas C. van der MerweCristine M. MynhardtTeresa W. Haynes — 2001

Discussiones Mathematicae Graph Theory

Denote the total domination number of a graph G by γₜ(G). A graph G is said to be total domination edge critical, or simply γₜ-critical, if γₜ(G+e) < γₜ(G) for each edge e ∈ E(G̅). For 3ₜ-critical graphs G, that is, γₜ-critical graphs with γₜ(G) = 3, the diameter of G is either 2 or 3. We characterise the 3ₜ-critical graphs G with diam G = 3.

Page 1

Download Results (CSV)