Abstract
The bondage number \(b(G)\) of a nonempty graph \(G\) is the smallest number of edges, removal of which from \(G\) results in a graph with domination number greater than that of \(G\). In this paper, we study the bondage number of Mycielski graphs. First, we present some properties of dominating sets and give sharp upper bounds for bondage numbers of Mycielski graphs. Second, we obtain a characterization of Mycielski graphs of trees bondage numbers of which are 1. Finally, we calculate the exact values for bondage numbers of Mycielski graphs underlying graphs of which are complete graphs, paths, cycles, complete \(t\)-partite graphs, etc.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Bulletin of the Malaysian Mathematical Sciences Society
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
