On an open problem concerning total domination critical graphs

DOI10.1016/J.EXMATH.2006.10.001zbMath1119.05081OpenAlexW2092604101MaRDI QIDQ996998

Doost Ali Mojdeh, Nader Jafari Rad

Publication date: 19 July 2007

Published in: Expositiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.exmath.2006.10.001

zbMATH Keywords

diametertotal dominationvertex critical

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (8)

Edge-removal and edge-addition in \(\alpha \)-domination ⋮ WEAKLY CONNECTED TOTAL DOMINATION CRITICAL GRAPHS ⋮ On the existence problem of the total domination vertex critical graphs ⋮ On \(4\)-\(\gamma_t\)-critical graphs of diameter two ⋮ Matching properties in total domination vertex critical graphs ⋮ Total $k$-distance domination critical graphs ⋮ The existence problem of \(k\mathrm{-}\gamma_t\)-critical graphs ⋮ Connected Domination

Cites Work

• Unnamed Item
• Matching properties in domination critical graphs.
• The diameter of total domination vertex critical graphs
• Critical concepts in domination
• The diameter of domination k‐critical graphs

This page was built for publication: On an open problem concerning total domination critical graphs