Total domination stability in graphs
From MaRDI portal
Publication:1693151
DOI10.1016/J.DAM.2017.07.022zbMath1377.05142OpenAlexW2774405535MaRDI QIDQ1693151
Marcin Krzywkowski, Michael A. Henning
Publication date: 11 January 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.07.022
Related Items (6)
Paired domination stability in graphs ⋮ On the edge chromatic vertex stability number of graphs ⋮ Complexity of stability ⋮ Complexity of Stability. ⋮ 2-rainbow domination stability of graphs ⋮ On the total Roman domination stability in graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Domination stability in graphs
- Domination alteration sets in graphs
- Total domination changing and stable graphs upon vertex removal
- Perfect matchings in total domination critical graphs
- Domination dot-critical graphs
- Matching properties in total domination vertex critical graphs
- On total domination vertex critical graphs of high connectivity
- The diameter of total domination vertex critical graphs
- Critical concepts in domination
- Bicritical domination
- Vertex domination-critical graphs
- The diameter of domination k‐critical graphs
- Total Domination in Graphs
- Total Domination in Categorical Products of Graphs
- Domination critical graphs
This page was built for publication: Total domination stability in graphs