  The independent domination number of a finite graph G is the minimum
cardinality of an independent dominating set of vertices. The independent
bondage number of G is the minimum cardinality of a set of edges whose deletion
results in a graph with a larger independent domination number than that of G.
In this research, we enhance the existing upper bound on the independent
bondage number of a planar graph with a minimum degree of at least three by
identifying specific configurations within such planar graphs.
