New results about the bondage number of a graph
From MaRDI portal
Publication:1363706
DOI10.1016/S0012-365X(96)00007-6zbMath0881.05067MaRDI QIDQ1363706
Publication date: 8 September 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
Trees (05C05) Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)
Related Items (31)
Edge criticality in graph domination ⋮ Total restrained bondage in graphs ⋮ Eternal \(m\)-security bondage numbers in graphs ⋮ Bondage number of the strong product of two trees ⋮ The bondage numbers of graphs with small crossing numbers ⋮ Construction for trees without domination critical vertices ⋮ The \(k\)-rainbow bondage number of a graph ⋮ The bondage number of generalized Petersen graphs \(P(n,2)\) ⋮ On construction for trees making the equality hold in Vizing's conjecture ⋮ On the average lower bondage number of graphs under join and corona operations ⋮ Relations between edge removing and edge subdivision concerning domination number of a graph ⋮ Bondage number of strong product of two paths ⋮ On the average lower bondage number of a graph ⋮ Non-isolating 2-bondage in graphs ⋮ On bondage numbers of graphs: a survey with some comments ⋮ Bondage number of grid graphs ⋮ The \(p\)-bondage number of trees ⋮ On the Roman bondage number of planar graphs ⋮ Upper bounds on the bondage number of the strong product of a graph and a tree ⋮ The bondage numbers of extended de Bruijn and Kautz digraphs ⋮ Bondage number of mesh networks ⋮ Some progress on total bondage in graphs ⋮ On the bondage number of planar and directed graphs ⋮ The total bondage number of grid graphs ⋮ Non-isolating bondage in graphs ⋮ Bondage numbers of Mycielski graphs ⋮ Restrained bondage in graphs ⋮ On the double bondage number of graphs products ⋮ Changing and unchanging of the domination number of a graph ⋮ On the complexity of multiple bondage in graphs ⋮ 2-bondage in graphs
Cites Work
- Domination alteration sets in graphs
- The bondage number of a graph
- Maximum number of edges in connected graphs with a given domination number
- Relations between packing and covering numbers of a tree
- A counterexample to a conjecture on the bondage number of a graph
- Bounds on the bondage number of a graph
- Parallel concepts in graph theory
- Vertex domination-critical graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: New results about the bondage number of a graph