Bounds on the bondage number of a graph

From MaRDI portal
Publication:1322182


DOI10.1016/0012-365X(94)90111-2zbMath0796.05051MaRDI QIDQ1322182

Bert L. Hartnell, Douglas F. Rall

Publication date: 15 September 1994

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


05C35: Extremal problems in graph theory


Related Items

Upper bounds on the bondage number of the strong product of a graph and a tree, Upper bounds on the bondage number of a graph, On the double bondage number of graphs products, The k-power bondage number of a graph, On the average lower bondage number of graphs under join and corona operations, On the double Roman bondage numbers of graphs, The bondage number of random graphs, On the bondage number of middle graphs, Upper bounds for the bondage number of graphs on topological surfaces, The \(k\)-rainbow bondage number of a graph, An improved upper bound for the bondage number of graphs on surfaces, NP-hardness of multiple bondage in graphs, 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, On the bondage, strong and weak bondage numbers in complementary prism graphs, The bondage numbers of graphs with small crossing numbers, Restrained bondage in graphs, On the bondage number of a graph, A bound on the size of a graph with given order and bondage number, New results about the bondage number of a graph, 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, Changing and unchanging of the domination number of a graph: path addition numbers, Domination in certain chemical graphs, On the complexity of multiple bondage in graphs, Total restrained bondage in graphs, Bondage number of the strong product of two trees, Independent bondage number of a graph, Bondage number of grid graphs, The bondage numbers and efficient dominations of vertex-transitive graphs, The bondage numbers of extended de Bruijn and Kautz digraphs, On the bondage number of planar and directed graphs, Independent bondage number of planar graphs with minimum degree at least 3, 2-bondage in graphs, On the average lower bondage number of a graph, A BOUND ON THE BONDAGE NUMBER OF TOROIDAL GRAPHS



Cites Work