Independent Domination Number of Cyclic and Acyclic Graphs

Let G = (V, E) be a graph with vertex set V and edge set E. A subset S ⊆ V is an independent dominating set if every vertex in S has its neighbour in V − S and no two vertices within S are adjacent. The independent domination number (IDN) i(G) is the smallest size of an independent dominating set. In this chapter, we find independent domination number of fan graph Fm, n, firecracker graph F(m, n), tadpole graph Tm, n, bistar graph Br, s, diamond snake graph Dn, banana tree B(m, n), coconut tree CT(m, n), Pappus graph, and the corona product Pm ∘ Pn.