A set S of vertices of a graph G is an independent dominating set of G ifS is an independent set and every vertex not in S is adjacent to a vertex in S. Theindependent domination number of G, denoted by i G , is the minimum cardinality ofan independent dominating set of G. In this paper, some new classes of graphs withequal domination and independent domination numbers are presented and exact valuesof their domination and independent domination numbers are determined
Journal Type : Ulusal
Relevant Articles | Author | # |
---|
Article | Author | # |
---|