On bondage numbers of graphs: a survey with some comments

DOI10.1155/2013/595210MaRDI QIDQ1953664zbMATH OpenOpenAlexWikidataFDO

Authors Jun-Ming Xu

Publication date 10 June 2013

Published in International Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1204.4010

zbMATH Keywords

domination numberbondage number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Abstract: The bondage number of a nonempty graph $G$ is the cardinality of a smallest edge set whose removal from $G$ results in a graph with domination number greater than the domination number of $G$. This lecture gives a survey on the bondage number, including the known results, problems and conjectures. We also summarize other types of bondage numbers.

Recommendations

• On the bondage number of a graph
• Upper bounds on the bondage number of a graph
• A bound on the size of a graph with given order and bondage number
• Bounds on the bondage number of a graph
• scientific article; zbMATH DE number 876673

Cites work

• scientific article; zbMATH DE number 5850802 (Why is no real title available?)
• scientific article; zbMATH DE number 437479 (Why is no real title available?)
• scientific article; zbMATH DE number 3144144 (Why is no real title available?)
• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• scientific article; zbMATH DE number 3902703 (Why is no real title available?)
• scientific article; zbMATH DE number 3914370 (Why is no real title available?)
• scientific article; zbMATH DE number 4049086 (Why is no real title available?)
• scientific article; zbMATH DE number 4085682 (Why is no real title available?)
• scientific article; zbMATH DE number 1185309 (Why is no real title available?)
• scientific article; zbMATH DE number 3702724 (Why is no real title available?)
• scientific article; zbMATH DE number 68339 (Why is no real title available?)
• scientific article; zbMATH DE number 146666 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 553912 (Why is no real title available?)
• scientific article; zbMATH DE number 637310 (Why is no real title available?)
• scientific article; zbMATH DE number 637526 (Why is no real title available?)
• scientific article; zbMATH DE number 731842 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1109414 (Why is no real title available?)
• scientific article; zbMATH DE number 1124610 (Why is no real title available?)
• scientific article; zbMATH DE number 1123784 (Why is no real title available?)
• scientific article; zbMATH DE number 1934392 (Why is no real title available?)
• scientific article; zbMATH DE number 1743834 (Why is no real title available?)
• scientific article; zbMATH DE number 1744072 (Why is no real title available?)
• scientific article; zbMATH DE number 2142620 (Why is no real title available?)
• scientific article; zbMATH DE number 2108130 (Why is no real title available?)
• scientific article; zbMATH DE number 825127 (Why is no real title available?)
• scientific article; zbMATH DE number 1409199 (Why is no real title available?)
• scientific article; zbMATH DE number 975419 (Why is no real title available?)
• scientific article; zbMATH DE number 2188621 (Why is no real title available?)
• scientific article; zbMATH DE number 4189776 (Why is no real title available?)
• scientific article; zbMATH DE number 3106184 (Why is no real title available?)
• A BOUND ON THE BONDAGE NUMBER OF TOROIDAL GRAPHS
• A bound on the size of a graph with given order and bondage number
• A characterization of \((2\gamma ,\gamma _{\text p})\)-trees
• A counterexample to a conjecture on the bondage number of a graph
• A note on distance domination numbers of graphs
• A note on the Roman bondage number of planar graphs
• A note on the bondage number of a graph
• A remark on the (2,2)-domination number
• A survey of selected recent results on total domination in graphs
• Algorithms for Vertex Partitioning Problems on Partial k-Trees
• An improved upper bound for the bondage number of graphs on surfaces
• An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree
• Average distances and distance domination numbers
• Bibliography on domination in graphs and some basic definitions of domination parameters
• Bondage number in oriented graphs.
• Bondage number of mesh networks
• Bondage number of planar graphs
• Bondage number of planar graphs without small cycles
• Bondage number of the discrete torus \(C_n\times C_4\)
• Bounds for distance domination numbers of graphs
• Bounds on the bondage number of a graph
• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• Distance domination-critical graphs
• Dominating Cartesian products of cycles
• Domination alteration sets in graphs
• Domination and bondage number of C₅ C_n.
• Domination critical graphs
• Domination with respect to nondegenerate properties: bondage number
• Domination, independent domination, and duality in strongly chordal graphs
• Efficient dominating sets in Cayley graphs.
• Efficient domination in circulant graphs
• Efficient domination in circulant graphs with two chord lengths
• Efficient domination of the orientations of a graph
• Extension of de Bruijn graph and Kautz graph
• Graphs with large restrained domination number
• Graphs with large total domination number
• Independent domination in graphs: A survey and recent results
• Independent perfect domination sets in Cayley graphs
• Maximum number of edges in connected graphs with a given domination number
• New results about the bondage number of a graph
• Non-isolating 2-bondage in graphs
• Note on conjectures of bondage numbers of planar graphs
• Note on the bondage number of graphs on topological surfaces
• On bondage number of toroidal graphs
• On computing a conditional edge-connectivity of a graph
• On dominating the Cartesian product of a graph and K₂
• On graphs with equal domination and covering numbers
• On the Algorithmic Complexity of Total Domination
• On the Roman \(k\)-bondage number of a graph
• On the Roman bondage number of a graph
• On the Roman bondage number of planar graphs
• On the (2,2)-domination number of trees
• On the bondage number of a graph
• On the bondage number of planar and directed graphs
• On the complexity of the bondage and reinforcement problems
• On the corona of two graphs
• On the total restrained domination number of a graph
• On total restrained domination in graphs
• Paired bondage in trees
• Paired-domination in graphs
• Paired-domination of trees
• Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs
• Rainbow domination in graphs
• Relations between packing and covering numbers of a tree
• Remarks on restrained domination and total restrained domination in graphs
• Remarks on the bondage number of planar graphs
• Restrained bondage in graphs
• Restrained domination in graphs
• Restrained domination in graphs with minimum degree two
• Restrained domination in trees
• Roman bondage in graphs
• Roman bondage numbers of some graphs
• Roman domination in graphs.
• Some progress on total bondage in graphs
• Steiner trees, connected domination and strongly chordal graphs
• THE BONDAGE NUMBER OF C₃×C_n
• The k-rainbow bondage number of a graph
• The \(p\)-bondage number of trees
• The bondage and connectivity of a graph
• The bondage and reinforcement numbers of \(\gamma_ f\) for some graphs
• The bondage number in complete \(t\)-partite digraphs
• The bondage number of a graph
• The bondage number of graphs on topological surfaces and Teschner's conjecture
• The bondage number of graphs with crossing number less than four
• The bondage number of graphs:good and bad vertices
• The bondage numbers and efficient dominations of vertex-transitive graphs
• The bondage numbers of extended de Bruijn and Kautz digraphs
• The bondage numbers of graphs with small crossing numbers
• The total bondage number of grid graphs
• The total domination and total bondage numbers of extended de Bruijn and Kautz digraphs
• Theory and Application of Graphs
• Total bondage number of a graph
• Total domination in graphs
• Total restrained bondage in graphs
• Trees with unique minimum p-dominating sets
• Upper bounds for the bondage number of graphs on topological surfaces
• Vertex domination-critical graphs
• Vertex domination‐critical graphs
• _k- and _k-stable graphs
• \(k\)-domination and \(k\)-independence in graphs: A survey

Cited in

(41)

• A survey of bond graphs: Theory, applications and programs
• On the bondage, strong and weak bondage numbers in complementary prism graphs
• On the complexity of the outer-connected bondage and the outer-connected reinforcement problems
• Open packing bondage number of a graph
• Upper bounds on the bondage number of a graph
• Bondage number of grid graphs
• The algorithmic complexity of bondage and reinforcement problems in bipartite graphs
• Semitotal bondage numbers of graphs
• The bondage number of graphs:good and bad vertices
• On the complexity of multiple bondage in graphs
• On the minimum number of bond-edge types and tile types: an approach by edge-colorings of graphs
• The bondage number in complete \(t\)-partite digraphs
• The bondage number of random graphs
• Remarks on the bondage number of planar graphs
• Characterization of trees with Roman bondage number 1
• Bondage numbers of Mycielski graphs
• A survey on the Intersection graphs of ideals of rings
• On the double Roman bondage numbers of graphs
• Upper bounds on the bondage number of the strong product of a graph and a tree
• A BOUND ON THE BONDAGE NUMBER OF TOROIDAL GRAPHS
• The \(k\)-power bondage number of a graph
• Minimum edge blocker dominating set problem
• On the bondage number of planar and directed graphs
• The disjunctive bondage number and the disjunctive total bondage number of graphs
• Eternal m-security bondage numbers in graphs
• On the \(\rho \)-edge stability number of graphs
• Some results of weakly nilpotent graphs of rings
• Upper bounds for domination related parameters in graphs on surfaces
• The bondage number of graphs on topological surfaces and Teschner's conjecture
• The structure and the bondage number of three classes of beyond-planar graphs
• scientific article; zbMATH DE number 6813629 (Why is no real title available?)
• Bondage number of the strong product of two trees
• The bondage and reinforcement numbers of \(\gamma_ f\) for some graphs
• NP-hardness of multiple bondage in graphs
• A Gallai’s Theorem type result for the edge stability of graphs
• The bondage number of generalized Petersen graphs \(P(n,2)\)
• The bondage number of the strong product of a complete graph with a path and a special starlike tree
• Roman domination in graphs
• scientific article; zbMATH DE number 1539534 (Why is no real title available?)
• Independent bondage number of planar graphs with minimum degree at least 3
• The total bondage numbers and efficient total dominations of vertex-transitive graphs

This page was built for publication: On bondage numbers of graphs: a survey with some comments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1953664)