The bondage number of graphs:good and bad vertices

Vladimir Samodivkin
<span title="">2008</span> <i title="Faculty of Mathematics, Computer Science and Econometrics, University of Zielona Gora"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/g64zvtslcjdqncvrfbmvf422qi" style="color: black;">Discussiones Mathematicae Graph Theory</a> </i> &nbsp;
The domination number γ(G) of a graph G is the minimum number of vertices in a set D such that every vertex of the graph is either in D or is adjacent to a member of D. Any dominating set D of a graph G with |D| = γ(G) is called a γ-set of G. A vertex x of a graph G is called: (i) γ-good if x belongs to some γ-set and (ii) γ-bad if x belongs to no γ-set. The bondage number b(G) of a nonempty graph G is the cardinality of a smallest set of edges whose removal from G results in a graph with
more &raquo; ... tion number greater then γ(G). In this paper we present new sharp upper bounds for b(G) in terms of γ-good and γ-bad vertices of G.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.7151/dmgt.1419">doi:10.7151/dmgt.1419</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/awczdvixwfejnkl47zg6ykna24">fatcat:awczdvixwfejnkl47zg6ykna24</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170816040355/http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1419/c/dmgt.1419.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/5e/86/5e866ffe6b330dbbb9801fa0317cb78219f6984b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.7151/dmgt.1419"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>