Eternal \(m\)-security bondage numbers in graphs
From MaRDI portal
Publication:1656913
DOI10.7151/dmgt.2054zbMath1392.05085MaRDI QIDQ1656913
Maryam Atapour, Hamideh Aram, Seyyed Mahmoud Sheikholeslami
Publication date: 10 August 2018
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2054
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Cites Work
- The bondage number of a graph
- A counterexample to a conjecture on the bondage number of a graph
- Bounds on the bondage number of a graph
- New results about the bondage number of a graph
- On bondage numbers of graphs: a survey with some comments
- The bondage numbers and efficient dominations of vertex-transitive graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item