Domination stability in graphs

DOI10.1016/J.DISC.2015.12.026zbMath1334.05105OpenAlexW2341947675MaRDI QIDQ279207

Marcin Krzywkowski, Elahe Sharifi, Nader Jafari Rad

Publication date: 27 April 2016

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2015.12.026

zbMATH Keywords

dominationdomination stability

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (7)

On trees with equal 2-domination and 2-outer-independent domination numbers ⋮ Paired domination stability in graphs ⋮ Total domination stability in graphs ⋮ On the 2-rainbow domination stable graphs ⋮ Some progress on the restrained Roman domination ⋮ 2-rainbow domination stability of graphs ⋮ On the total Roman domination stability in graphs

Cites Work

• Unnamed Item
• Bicritical domination and double coalescence of graphs
• Domination alteration sets in graphs
• Domination dot-critical graphs
• Critical concepts in domination
• Bicritical domination
• Edge subdivision and edge multisubdivision versus some domination related parameters in generalized corona graphs
• Vertex domination-critical graphs
• The diameter of domination k‐critical graphs
• Domination critical graphs

This page was built for publication: Domination stability in graphs