DOMINATION IN JAHANGIR GRAPH J2,m

Given graphs G=(V,E), a dominating set S is a subset of vertex set V such that any vertex not in S is adjacent to at least one vertex in S. The domination number of a graph G is the minimum size of the dominating sets of G. In this paper we study some results on domination number, connected, independent, total and restrained domination number denoted by y(G), yc(G), i(G), yt(G) and yr(G) respectively in Jahangir graphs J2,m.

Keywords:

Jahangir graphs , domination number , independent , total , restrained