Restrained bondage in graphs
From MaRDI portal
Publication:998423
DOI10.1016/J.DISC.2007.10.016zbMATH Open1186.05091OpenAlexW2030319170MaRDI QIDQ998423FDOQ998423
Authors: Johannes H. Hattingh, Andrew R. Plummer 
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.016
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The bondage number of a graph
- Graphs with large restrained domination number
- Restrained domination in graphs
- Bounds on the bondage number of a graph
- Restrained domination in trees
- Restrained domination in graphs with minimum degree two
- Algorithms for Vertex Partitioning Problems on Partial k-Trees
- Domination alteration sets in graphs
- New results about the bondage number of a graph
- Title not available (Why is that?)
Cited In (17)
- Restrained reinforcement number in graphs
- Total restrained bondage in graphs
- The restrained rainbow bondage number of a graph
- The algorithmic complexity of bondage and reinforcement problems in bipartite graphs
- The \(p\)-bondage number of trees
- On the complexity of the bondage and reinforcement problems
- Restrained {2}-domination in graphs
- Restrained Italian bondage number in graphs
- Title not available (Why is that?)
- Complexity and bounds for disjunctive total bondage
- On bondage numbers of graphs: a survey with some comments
- Upper bounds for domination related parameters in graphs on surfaces
- Bondage number of mesh networks
- The total bondage number of grid graphs
- Restrained bondage number of a graph
- On the Roman bondage number of a graph
- On the complexity of the outer-connected bondage and the outer-connected reinforcement problems
This page was built for publication: Restrained bondage in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998423)
