Graphs with equal domination and independent domination numbers

Abstract

Let γ(G) and i(G) denote the domination number and independent domination number of a graph G. In this article, we establish a sufficient condition for a graph G to satisfy which yields some of the well known classical theorems as corollaries. Further, we also construct several families of graphs G satisfying γ(G) = i(G) using the sufficient condition.