Some progress on total bondage in graphs
From MaRDI portal
Publication:2014725
DOI10.1007/S00373-013-1303-2zbMATH Open1291.05149DBLPjournals/gc/RadR14OpenAlexW2064268947WikidataQ59397554 ScholiaQ59397554MaRDI QIDQ2014725FDOQ2014725
Authors: Joanna Raczek, Nader Jafari Rad 
Publication date: 16 June 2014
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-013-1303-2
Recommendations
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- On the complexity of the bondage and reinforcement problems
- A survey of selected recent results on total domination in graphs
- The bondage number of a graph
- Bounds on the bondage number of a graph
- Domination alteration sets in graphs
- New results about the bondage number of a graph
- Title not available (Why is that?)
- The bondage and reinforcement numbers of \(\gamma_ f\) for some graphs
- Title not available (Why is that?)
- The \(p\)-bondage number of trees
- Total bondage number of a graph
- Paired bondage in trees
Cited In (8)
- Title not available (Why is that?)
- On bondage numbers of graphs: a survey with some comments
- Total bondage number of a graph
- The total bondage number of grid graphs
- Title not available (Why is that?)
- NP-hardness of multiple bondage in graphs
- Non-isolating bondage in graphs
- The total bondage numbers and efficient total dominations of vertex-transitive graphs
This page was built for publication: Some progress on total bondage in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2014725)
