The bondage number of a graph
From MaRDI portal
Publication:1174124
DOI10.1016/0012-365X(90)90348-LzbMath0745.05056WikidataQ105806625 ScholiaQ105806625MaRDI QIDQ1174124
Publication date: 25 June 1992
Published in: Discrete Mathematics (Search for Journal in Brave)
Trees (05C05) Extremal problems in graph theory (05C35) Graph theory (05C99) Applications of graph theory to circuits and networks (94C15)
Related Items (81)
On the bondage, strong and weak bondage numbers in complementary prism graphs ⋮ The bondage number of random graphs ⋮ Transferable domination number of graphs ⋮ Characterization of trees with Roman bondage number 1 ⋮ A BOUND ON THE BONDAGE NUMBER OF TOROIDAL GRAPHS ⋮ Edge criticality in graph domination ⋮ Total restrained bondage in graphs ⋮ The k-power bondage number of a graph ⋮ Minimum edge blocker dominating set problem ⋮ The bondage and reinforcement numbers of \(\gamma_ f\) for some graphs ⋮ The independent transversal dombondage number of a graph ⋮ The Disjunctive Bondage Number and the Disjunctive Total Bondage Number of Graphs ⋮ New results about the bondage number of a graph ⋮ Eternal \(m\)-security bondage numbers in graphs ⋮ Bondage number of the strong product of two trees ⋮ On the bondage number of middle graphs ⋮ Complexity and bounds for disjunctive total bondage ⋮ On the bondage number of a graph ⋮ Upper bounds for the bondage number of graphs on topological surfaces ⋮ The \(k\)-rainbow bondage number of a graph ⋮ The bondage number of generalized Petersen graphs \(P(n,2)\) ⋮ On the average lower bondage number of graphs under join and corona operations ⋮ Independent bondage number of a graph ⋮ Bondage number of strong product of two paths ⋮ On the average lower bondage number of a graph ⋮ Unnamed Item ⋮ Quasi-total Roman bondage number in graphs ⋮ On the double Roman bondage numbers of graphs ⋮ On the complexity of the bondage and reinforcement problems ⋮ Domination in generalized unit and unitary Cayley graphs of finite rings ⋮ Restrained Italian bondage number in graphs ⋮ Non-isolating 2-bondage in graphs ⋮ On bondage numbers of graphs: a survey with some comments ⋮ Bondage number of grid graphs ⋮ An improved upper bound for the bondage number of graphs on surfaces ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The algorithmic complexity of bondage and reinforcement problems in bipartite graphs ⋮ Exponential Independence Number of Some Graphs ⋮ The discipline number of a graph ⋮ The \(p\)-bondage number of trees ⋮ On the Roman bondage number of planar graphs ⋮ Unnamed Item ⋮ Blockers for the stability number and the chromatic number ⋮ NP-hardness of multiple bondage in graphs ⋮ Upper bounds on the bondage number of the strong product of a graph and a tree ⋮ The bondage numbers and efficient dominations of vertex-transitive graphs ⋮ Restrained bondage number of a graph ⋮ The total domination and total bondage numbers of extended de Bruijn and Kautz digraphs ⋮ The bondage numbers of extended de Bruijn and Kautz digraphs ⋮ Bondage number of mesh networks ⋮ ON THE ROMAN BONDAGE NUMBER OF A GRAPH ⋮ Domination in certain chemical graphs ⋮ Some progress on total bondage in graphs ⋮ On the bondage number of planar and directed graphs ⋮ The total bondage number of grid graphs ⋮ The bondage number in complete \(t\)-partite digraphs ⋮ On the complexity of the outer-connected bondage and the outer-connected reinforcement problems ⋮ Roman \(\{2\}\)-bondage number of a graph ⋮ Non-isolating bondage in graphs ⋮ Bondage numbers of Mycielski graphs ⋮ Restrained bondage in graphs ⋮ Paired bondage in trees ⋮ On the double bondage number of graphs products ⋮ Domination parameters in coronene torus network ⋮ INDEPENDENT DOM-SATURATION NUMBER OF A GRAPH ⋮ Reinforcement numbers of digraphs ⋮ Open packing bondage number of a graph ⋮ A bound on the size of a graph with given order and bondage number ⋮ The total bondage numbers and efficient total dominations of vertex-transitive graphs ⋮ On the complexity of multiple bondage in graphs ⋮ 2-bondage in graphs ⋮ Split bondage numbers of a graph ⋮ Upper bounds on the bondage number of a graph ⋮ Bondage number of the discrete torus \(C_n\times C_4\) ⋮ The \(k\)-rainbow bondage number of a digraph ⋮ Characterization of Graphs G for which ⋮ A counterexample to a conjecture on the bondage number of a graph ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters ⋮ Bounds on the bondage number of a graph ⋮ Total Roman domination subdivision number in graphs
Cites Work
This page was built for publication: The bondage number of a graph
