•  
  •  
 

Abstract

Given a finite, simple, connected graph G with at least one edge, the independent bondage number 𝑏𝑏𝑏𝑏⁑(𝐺𝐺) of G is the minimum size of an edge set, such that its deletion results in a graph with a strictly larger independent domination number than that of G. While the bondage number of graphs under girth constraints has been studied, very few results have yet been established for the independent bondage number. In this study, we establish upper bounds on the independent bondage number of planar graphs under given girth constraints, extending results on the bondage number by Fischermann, Rautenbach, and Volkmann and on the structures of planar graphs by Borodin and Ivanova. In particular, we identify additional structures and establish bounds on the independent bondage number for planar graphs with 𝛿𝛿⁑(𝐺𝐺) β‰₯2 and 𝑔𝑔⁑(𝐺𝐺) β‰₯5, 𝛿𝛿⁑(𝐺𝐺) β‰₯3 and 𝑔𝑔⁑(𝐺𝐺) β‰₯4, 𝛿𝛿⁑(𝐺𝐺) β‰₯2 and 𝑔𝑔⁑(𝐺𝐺) β‰₯7, and 𝛿𝛿⁑(𝐺𝐺) β‰₯2 and 𝑔𝑔⁑(𝐺𝐺) β‰₯10, showing that the corresponding bounds are 𝑏𝑏𝑏𝑏⁑(𝐺𝐺) ≀5, 𝑏𝑏𝑏𝑏⁑(𝐺𝐺) ≀6, 𝑏𝑏𝑏𝑏⁑(𝐺𝐺) ≀4, and 𝑏𝑏𝑏𝑏⁑(𝐺𝐺) ≀3, respectively.

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.