A constructive characterization of total domination vertex critical graphs
From MaRDI portal
Recommendations
Cited in
(14)- On total domination vertex critical graphs of high connectivity
- On 2-rainbow domination of generalized Petersen graphs
- A characterization of independent domination critical graphs with a cutvertex
- scientific article; zbMATH DE number 2084268 (Why is no real title available?)
- Connected domination
- scientific article; zbMATH DE number 5119241 (Why is no real title available?)
- On 3-_t-vertex critical graphs of diameter three
- Total domination critical graphs with maximal order
- On maximum total domination vertex critical graphs
- Total domination dot-critical graphs
- On the existence problem of the total domination vertex critical graphs
- Total domination changing and stable graphs upon vertex removal
- Perfect matchings in total domination critical graphs
- Matching properties in total domination vertex critical graphs
This page was built for publication: A constructive characterization of total domination vertex critical graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1011745)