Total domination critical and stable graphs upon edge removal

DOI10.1016/j.dam.2010.06.003zbMath1237.05148OpenAlexW2162243707MaRDI QIDQ602674

Teresa W. Haynes, Wyatt J. Desormeaux, Michael A. Henning

Publication date: 5 November 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2010.06.003

zbMATH Keywords

total domination numbertotal dominating settotal domination edge criticaltotal domination edge stable

Mathematics Subject Classification ID

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

Related Items (9)

WEAKLY CONNECTED TOTAL DOMINATION CRITICAL GRAPHS ⋮ Total domination stable graphs upon edge addition ⋮ Connected certified domination edge critical and stable graphs ⋮ Edge lifting and total domination in graphs ⋮ Total domination changing and stable graphs upon vertex removal ⋮ Complexity of stability ⋮ Complexity of Stability. ⋮ An extremal problem for total domination stable graphs upon edge removal ⋮ Total Roman Domination Edge-Supercritical and Edge-Removal-Supercritical Graphs

Cites Work

• A survey of selected recent results on total domination in graphs
• The diameter of total domination vertex critical graphs
• Total domination in graphs
• Graphs with large total domination number
• Total Domination Edge Critical Graphs with Maximum Diameter
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Total domination critical and stable graphs upon edge removal