2-bondage in graphs
From MaRDI portal
Publication:2855759
DOI10.1080/00207160.2012.752817zbMath1273.05163OpenAlexW2082377119MaRDI QIDQ2855759
Publication date: 22 October 2013
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2012.752817
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (max. 100)
The vulnerability of some networks including cycles via domination parameters ⋮ NP-hardness of multiple bondage in graphs ⋮ Roman \(\{2\}\)-bondage number of a graph ⋮ Non-isolating bondage in graphs ⋮ On the complexity of multiple bondage in graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Paired bondage in trees
- The bondage number of a graph
- Bounds on the bondage number of a graph
- The bondage and reinforcement numbers of \(\gamma_ f\) for some graphs
- New results about the bondage number of a graph
- Bondage number of planar graphs
- The bondage and connectivity of a graph
This page was built for publication: 2-bondage in graphs