Total domination stability in graphs
From MaRDI portal
Publication:1693151
DOI10.1016/J.DAM.2017.07.022zbMATH Open1377.05142OpenAlexW2774405535MaRDI QIDQ1693151FDOQ1693151
Authors: Michael A. Henning, Marcin Krzywkowski 
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
Recommendations
- Domination stability in graphs
- Disjunctive total domination stability in graphs
- Total domination dot-stable graphs
- scientific article; zbMATH DE number 1109413
- Total domination in graphs
- Total domination of graphs
- Domination integrity of total graphs
- Stability, domination and irredundance in a graph
- On (fully) total domination dot-stable graphs
- Stability and domination exponentially in some graphs
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Total domination in graphs
- Critical concepts in domination
- Bicritical domination
- Domination stability in graphs
- Vertex domination-critical graphs
- The diameter of domination k‐critical graphs
- Domination alteration sets in graphs
- Domination critical graphs
- Domination dot-critical graphs
- On total domination vertex critical graphs of high connectivity
- Matching properties in total domination vertex critical graphs
- The diameter of total domination vertex critical graphs
- Total domination changing and stable graphs upon vertex removal
- Perfect matchings in total domination critical graphs
- Total Domination in Categorical Products of Graphs
Cited In (14)
- On the edge chromatic vertex stability number of graphs
- Exponential Domination Critical and Stability in Some Graphs
- Stable dominating circuits in snarks
- On (fully) total domination dot-stable graphs
- Stability in CAN-free graphs
- 2-rainbow domination stability of graphs
- An extremal problem for total domination stable graphs upon edge removal
- On the total Roman domination stability in graphs
- Paired domination stability in graphs
- Complexity of stability
- Disjunctive total domination stability in graphs
- Total domination changing and stable graphs upon vertex removal
- On stability of non-domination under taking products
- Complexity of Stability.
This page was built for publication: Total domination stability in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1693151)
