Independent Bondage Number in Planar Graphs Under Girth Constraints

Given a finite, simple, connected graph G with at least one edge, the independent bondage number bi(G) 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 δ(G)≥2 and g(G)≥5, δ(G)≥3 and g(G)≥4, δ(G)≥2 and g(G)≥7, and δ(G)≥2 and g(G)≥10, showing that the corresponding bounds are bi(G)≤5, bi(G)≤6, bi(G)≤4, and bi(G)≤3, respectively.