Total edge critical graphs with leaves

DOI10.1016/j.disc.2012.09.001zbMath1280.05100OpenAlexW2028792647MaRDI QIDQ1759387

Xianqiang Yang

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

zbMATH Keywords

total dominationtotal domination number\(\gamma t(G)\)-critical graph\(\gamma t\)-critical unicyclic graphstotal domination edge critical graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Connected domination critical graphs with cut vertices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Total edge critical graphs with leaves