INDEPENDENT DOMINATION NUMBER OF GRAPHS THROUGH VERTEX SWITCHING

INDEPENDENT DOMINATION NUMBER OF GRAPHS THROUGH VERTEX SWITCHING

S. T. Parveen, B. J. Balamurugan

[PDF]

Abstract

Let G = (V;E) be a graph with vertex set V and edge set E. An inde- pendent dominating set S of G is a subset of V with the property that every vertex in V ???? S is adjacent to some vertex in S and no two vertices within S are adjacent. The number of vertices in a minimum independent dominating set in the graph G is called the independent domination number i(G) of G. In this article, the independent domi- nation number of graphs obtained through vertex switching have been computed with appropriate illustration.

Keywords

Graphs, independent domination, independent dominating set, independent domination number, vertex switching.