New results about the bondage number of a graph

DOI10.1016/S0012-365X(96)00007-6zbMath0881.05067MaRDI QIDQ1363706

Ulrich Teschner

Publication date: 8 September 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

characterization; trees; dominating set; domination number; bondage number

Mathematics Subject Classification ID

05C05: Trees

05C35: Extremal problems in graph theory

05C75: Structural characterization of families of graphs

Related Items

Upper bounds on the bondage number of the strong product of a graph and a tree, On the double bondage number of graphs products, 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, Edge criticality in graph domination, The \(k\)-rainbow bondage number of a graph, The \(p\)-bondage number of trees, On the Roman bondage number of planar graphs, Bondage number of mesh networks, The total bondage number of grid graphs, Non-isolating bondage in graphs, Bondage numbers of Mycielski graphs, The bondage numbers of graphs with small crossing numbers, Bondage number of strong product of two paths, Restrained bondage in graphs, Eternal \(m\)-security bondage numbers in graphs, Non-isolating 2-bondage in graphs, On bondage numbers of graphs: a survey with some comments, Some progress on total bondage in graphs, The bondage number of generalized Petersen graphs \(P(n,2)\), On the complexity of multiple bondage in graphs, Total restrained bondage in graphs, Bondage number of the strong product of two trees, Relations between edge removing and edge subdivision concerning domination number of a graph, Bondage number of grid graphs, The bondage numbers of extended de Bruijn and Kautz digraphs, On the bondage number of planar and directed graphs, Changing and unchanging of the domination number of a graph, Construction for trees without domination critical vertices, 2-bondage in graphs, On the average lower bondage number of a graph

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