Upper bounds on the bondage number of a graph

Upper bounds on the bondage number of a graph

<p>The bondage number b(G) of a graph G is the smallest number of edges whose removal from G results in a graph with larger domination number. We obtain sufficient conditions for the validity of the inequality <span class="math"><em>b</em>(<em>G</em>) ≤ ...

Full description

Bibliographic Details
Main Author: Vladimir Dimitrov Samodivkin
Format: Article
Language:English
Published: Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 2018-04-01
Series:Electronic Journal of Graph Theory and Applications
Subjects:
bondage number, domination number, euler's formula, girth, average degree
Online Access:https://www.ejgta.org/index.php/ejgta/article/view/129

Internet

https://www.ejgta.org/index.php/ejgta/article/view/129

Similar Items