On total domination vertex critical graphs of high connectivity

DOI10.1016/j.dam.2008.12.009zbMath1197.05107OpenAlexW2001797308MaRDI QIDQ1026168

Michael A. Henning, Nader Jafari Rad

Publication date: 24 June 2009

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

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

zbMATH Keywords

diameterconnectivitytotal dominationvertex critical

Mathematics Subject Classification ID

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

Related Items (9)

Edge-removal and edge-addition in \(\alpha \)-domination ⋮ Paired domination stability in graphs ⋮ Total domination dot-critical graphs ⋮ On the existence problem of the total domination vertex critical graphs ⋮ On 3-\(\gamma_t\)-vertex critical graphs of diameter three ⋮ Total domination stability in graphs ⋮ On \(4\)-\(\gamma_t\)-critical graphs of diameter two ⋮ Perfect matchings in total domination critical graphs ⋮ The existence problem of \(k\mathrm{-}\gamma_t\)-critical graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The diameter of total domination vertex critical graphs
• Vertex domination-critical graphs
• Total domination in graphs
• THE MAXIMUM CONNECTIVITY OF A GRAPH

This page was built for publication: On total domination vertex critical graphs of high connectivity