Independent bondage number of planar graphs with minimum degree at least 3 (Q2675833)

Let \(G=(V,E)\) be a simple graph. A dominating set of \(G\) is a subset \(D\subseteq V\) such that every vertex not in \(D\) is adjacent to at least one vertex in \(D\). Additionally, if \(D\) is independent as well, we say \(D\) is an independent dominating set. The cardinality of the smallest independent dominating set of \(G\), denoted by \(\gamma_i(G)\), is the independent domination number of \(G\). The independent bondage number of \(G\) is denoted by \(b_i(G)\) and is the minimum number of edges whose removal changes the independent domination number. Domination number and bondage number have been an active research topic in the past few decades. Independent bondage is a newer concept and has few results about it. The authors in this paper have shown that for planar graphs with minimum degree \(\delta(G)\geq 3\), we have \(b_i(G)\leq 9\). Also, they constructed a class of planar graphs with \(b_i(G)=6\).