Forcing Independent Domination Number of a Graph

Cris Laquibla Armada, Sergio, Jr. R. Canoy

Abstract

In this paper, we obtain the forcing independent domination number of some special graphs. Further, we determine the forcing independent domination number of graphs  under some binary operations such join, corona and lexicographic product of two graphs.

Keywords

domination, forcing, independent, join, corona, lexicographic product

Full Text:

PDF