On bondage numbers of graphs: a survey with some comments

DOI10.1155/2013/595210zbMath1267.05201arXiv1204.4010WikidataQ21284826 ScholiaQ21284826MaRDI QIDQ1953664

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 number; bondage number

Mathematics Subject Classification ID

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

Related Items

Upper bounds on the bondage number of the strong product of a graph and a tree, Unnamed Item, Upper bounds on the bondage number of a graph, Open packing bondage number of a graph, The k-power bondage number of a graph, On the complexity of the outer-connected bondage and the outer-connected reinforcement problems, Some results of weakly nilpotent graphs of rings, On the double Roman bondage numbers of graphs, A survey on the Intersection graphs of ideals of rings, The bondage number of random graphs, Minimum edge blocker dominating set problem, Upper bounds for domination related parameters in graphs on surfaces, NP-hardness of multiple bondage in graphs, Bondage numbers of Mycielski graphs, Eternal \(m\)-security bondage numbers in graphs, On the \(\rho \)-edge stability number of graphs, Characterization of trees with Roman bondage number 1, The bondage number of generalized Petersen graphs \(P(n,2)\), The total bondage numbers and efficient total dominations of vertex-transitive graphs, On the complexity of multiple bondage in graphs, Bondage number of the strong product of two trees, Bondage number of grid graphs, The algorithmic complexity of bondage and reinforcement problems in bipartite graphs, Independent bondage number of planar graphs with minimum degree at least 3, The bondage number of the strong product of a complete graph with a path and a special starlike tree, Roman Domination in Graphs, The Disjunctive Bondage Number and the Disjunctive Total Bondage Number of Graphs

Cites Work

• Upper bounds for the bondage number of graphs on topological surfaces
• The \(k\)-rainbow bondage number of a graph
• On the complexity of the bondage and reinforcement problems
• An improved upper bound for the bondage number of graphs on surfaces
• Domination alteration sets in graphs
• On the Roman \(k\)-bondage number of a graph
• The \(p\)-bondage number of trees
• On the Roman bondage number of planar graphs
• \(k\)-domination and \(k\)-independence in graphs: A survey
• Bondage number of mesh networks
• The total bondage number of grid graphs
• Domination, independent domination, and duality in strongly chordal graphs
• Bibliography on domination in graphs and some basic definitions of domination parameters
• Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs
• Efficient domination in circulant graphs with two chord lengths
• The bondage numbers of graphs with small crossing numbers
• Rainbow domination in graphs
• A characterization of \((2\gamma ,\gamma _{\text p})\)-trees
• An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree
• The bondage number in complete \(t\)-partite digraphs
• Restrained bondage in graphs
• Paired bondage in trees
• A survey of selected recent results on total domination in graphs
• Average distances and distance domination numbers
• On computing a conditional edge-connectivity of a graph
• On the bondage number of a graph
• 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 bound on the size of a graph with given order and bondage number
• Graphs with large restrained domination number
• Restrained domination in graphs
• A counterexample to a conjecture on the bondage number of a graph
• Bounds on the bondage number of a graph
• On graphs with equal domination and covering numbers
• The bondage and reinforcement numbers of \(\gamma_ f\) for some graphs
• New results about the bondage number of a graph
• Efficient domination of the orientations of a graph
• Efficient dominating sets in Cayley graphs.
• Roman domination in graphs.
• Bondage number of planar graphs
• Paired-domination of trees
• Remarks on the bondage number of planar graphs
• The bondage and connectivity of a graph
• Dominating Cartesian products of cycles
• Extension of de Bruijn graph and Kautz graph
• Independent domination in graphs: A survey and recent results
• Efficient domination in circulant graphs
• The bondage number of graphs on topological surfaces and Teschner's conjecture
• Non-isolating 2-bondage in graphs
• Restrained domination in trees
• \(\alpha_k\)- and \(\gamma_k\)-stable graphs
• Some progress on total bondage in graphs
• A note on the Roman bondage number of planar graphs
• Total restrained bondage in graphs
• The bondage numbers and efficient dominations of vertex-transitive graphs
• The total domination and total bondage numbers of extended de Bruijn and Kautz digraphs
• Total bondage number of a graph
• The bondage numbers of extended de Bruijn and Kautz digraphs
• Distance domination-critical graphs
• On the bondage number of planar and directed graphs
• On the corona of two graphs
• Bondage number of the discrete torus \(C_n\times C_4\)
• Independent perfect domination sets in Cayley graphs
• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• Note on the bondage number of graphs on topological surfaces
• Roman Bondage Numbers of Some Graphs
• Roman bondage in graphs
• On the (2,2)-domination number of trees
• A BOUND ON THE BONDAGE NUMBER OF TOROIDAL GRAPHS
• On total restrained domination in graphs
• Remarks on restrained domination and total restrained domination in graphs
• A remark on the (2,2)-domination number
• The bondage number of graphs:good and bad vertices
• On the Algorithmic Complexity of Total Domination
• Steiner trees, connected domination and strongly chordal graphs
• Vertex domination-critical graphs
• Total domination in graphs
• Algorithms for Vertex Partitioning Problems on Partial k-Trees
• Theory and Application of Graphs
• Graphs with large total domination number
• Paired-domination in graphs
• On dominating the Cartesian product of a graph and K₂
• Vertex domination‐critical graphs
• ON THE ROMAN BONDAGE NUMBER OF A GRAPH
• THE BONDAGE NUMBER OF C₃×C_n
• Domination critical graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item