Pongpat Sittitrai

The Independent Bondage Number of Planar Graphs Without Short Cycles

An independent dominating set I of a graph G is an independent set such that every vertex in V(G)−I has at least one neighbor in I. The independent domination number of G is the minimum cardinality of an independent dominating set of G. The independent bondage number of a graph G, denoted by bi(G), is the minimum cardi...