Paired bondage in trees
From MaRDI portal
Publication:998438
DOI10.1016/J.DISC.2007.10.010zbMATH Open1161.05022OpenAlexW2074487881MaRDI QIDQ998438FDOQ998438
Authors: Joanna Raczek
Publication date: 28 January 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.10.010
Recommendations
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Paired-domination in claw-free cubic graphs
- The bondage number of a graph
- Paired-domination in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Paired-domination of trees
- Bondage number of planar graphs
- The bondage and connectivity of a graph
- Title not available (Why is that?)
Cited In (11)
- Total restrained bondage in graphs
- Non-isolating 2-bondage in graphs
- The \(p\)-bondage number of trees
- Some progress on total bondage in graphs
- 2-bondage in graphs
- Paired domination stability in graphs
- Complexity and bounds for disjunctive total bondage
- On bondage numbers of graphs: a survey with some comments
- Bondage number of mesh networks
- NP-hardness of multiple bondage in graphs
- Uniformly pair-bonded trees.
This page was built for publication: Paired bondage in trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998438)