Independent domination number of some wheel and path related graphs.

A set D of vertices in a graph G is a dominating set if every vertex in V-D is adjacent to some vertex in D. The domination number γ(G) is the minimum cardinality of the dominating set of G. A set of vertices in a graph is independent if no two vertices in it are adjacent. An Independent dominating set of G is a set that is both dominating and independent in G. The minimum cardinality of Independent dominating set is called as Independence Domination number. In this paper, we discuss the independent dominating set and domination number for some wheel related graphs such as Spider web graph W(t,n−1), Flower graph Fln, and Sunflower graph Sfn. We also deduce the independent domination number of some path related graphs such as Fan graph Fm,n, Coconut tree graph CT(n,k) and Book graph Bm. [ABSTRACT FROM AUTHOR]