The \(p\)-bondage number of trees
From MaRDI portal
Publication:659674
DOI10.1007/s00373-010-0956-3zbMath1235.05107OpenAlexW2138928785MaRDI QIDQ659674
Publication date: 24 January 2012
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-010-0956-3
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (4)
On bondage numbers of graphs: a survey with some comments ⋮ NP-hardness of multiple bondage in graphs ⋮ Some progress on total bondage in graphs ⋮ On the complexity of multiple bondage in graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The bondage numbers of graphs with small crossing numbers
- A note on the k-domination number of a graph
- Restrained bondage in graphs
- Paired bondage in trees
- On a conjecture of Fink and Jacobson concerning k-domination and k- dependence
- The bondage number of a graph
- Bounds on the bondage number of a graph
- New results about the bondage number of a graph
- Bondage number of planar graphs
- Remarks on the bondage number of planar graphs
- The bondage and connectivity of a graph
- The bondage numbers and efficient dominations of vertex-transitive graphs
- The total domination and total bondage numbers of extended de Bruijn and Kautz digraphs
- The bondage numbers of extended de Bruijn and Kautz digraphs
- On the bondage number of planar and directed graphs
- Some bounds on the \(p\)-domination number in trees
- Bondage number of the discrete torus \(C_n\times C_4\)
This page was built for publication: The \(p\)-bondage number of trees