The maximum diameter of total domination edge-critical graphs
From MaRDI portal
Publication:658066
DOI10.1016/j.disc.2011.09.032zbMath1233.05095OpenAlexW2064305594MaRDI QIDQ658066
Michael A. Henning, Lucas C. Van Der Merwe
Publication date: 11 January 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.09.032
Extremal problems in graph theory (05C35) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (2)
Total edge critical graphs with leaves ⋮ Hamiltonicity of \(3_t\)EC graphs with \(\alpha=\kappa +1\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of selected recent results on total domination in graphs
- Hamiltonicity in 3-domination-critical graphs with \(\alpha= \delta+2\)
- Some properties of 3-domination-critical graphs
- The diameter of total domination vertex critical graphs
- Critical concepts in domination
- Hamiltonian properties of domination-critical graphs
- Total domination in graphs
- The diameter of domination k‐critical graphs
- Independence and hamiltonicity in 3-domination-critical graphs
- Total Domination Edge Critical Graphs with Maximum Diameter
- Domination critical graphs
This page was built for publication: The maximum diameter of total domination edge-critical graphs