A constructive characterization of total domination vertex critical graphs
From MaRDI portal
Publication:1011745
DOI10.1016/j.disc.2008.01.015zbMath1166.05009OpenAlexW2081433045MaRDI QIDQ1011745
Xiangwen Li, Chunxiang Wang, Zhi-quan Hu
Publication date: 9 April 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.01.015
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (7)
Total domination dot-critical graphs ⋮ On 3-\(\gamma_t\)-vertex critical graphs of diameter three ⋮ Total domination changing and stable graphs upon vertex removal ⋮ Perfect matchings in total domination critical graphs ⋮ On 2-rainbow domination of generalized Petersen graphs ⋮ Matching properties in total domination vertex critical graphs ⋮ Connected Domination
Cites Work
This page was built for publication: A constructive characterization of total domination vertex critical graphs
