The k-power bondage number of a graph
From MaRDI portal
Publication:5298349
DOI10.1142/S1793830916500646zbMath1351.05175OpenAlexW2516893857MaRDI QIDQ5298349
Seethu Varghese, Ambat Vijayakumar
Publication date: 14 December 2016
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830916500646
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized power domination of graphs
- Domination alteration sets in graphs
- Improved algorithms and complexity results for power domination in graphs
- Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
- The bondage number of a graph
- Bounds on the bondage number of a graph
- On bondage numbers of graphs: a survey with some comments
- Generalized power domination: propagation radius and Sierpiński graphs
- A note on power domination in grid graphs
- Power domination in graphs
- On the Power Domination Number of Graph Products
- Generalized Power Domination in Regular Graphs
- Heredity for generalized power domination
- Power Domination in Product Graphs
- Power domination in honeycomb networks
- Domination in Graphs Applied to Electric Power Networks
- Domination critical graphs
This page was built for publication: The k-power bondage number of a graph
