Total edge critical graphs with leaves
From MaRDI portal
Publication:1759387
DOI10.1016/j.disc.2012.09.001zbMath1280.05100MaRDI QIDQ1759387
Publication date: 20 November 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2012.09.001
total domination; total domination number; \(\gamma t(G)\)-critical graph; \(\gamma t\)-critical unicyclic graphs; total domination edge critical graph
05C35: Extremal problems in graph theory
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Cites Work
- On the existence of \(k\)-partite or \(K_p\)-free total domination edge-critical graphs
- On a conjecture of Murty and Simon on diameter two critical graphs. II.
- The maximum diameter of total domination edge-critical graphs
- Properties of total domination edge-critical graphs
- On a conjecture of Murty and Simon on diameter 2-critical graphs
- Total Domination Edge Critical Graphs with Maximum Diameter
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item