An extremal problem for total domination stable graphs upon edge removal

DOI10.1016/j.dam.2011.01.025zbMath1219.05117OpenAlexW1970989805MaRDI QIDQ548282

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

Publication date: 28 June 2011

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

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

zbMATH Keywords

extremal problemtotal dominationedge removal 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

A partial compactification for linear systems ⋮ Unnamed Item ⋮ On disjunctive domination in graphs ⋮ The Bruhat decomposition of finite Hankel matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Total domination critical and stable graphs upon edge removal
• A survey of selected recent results on total domination in graphs
• Graphs with large total domination number