Domination in Jahangir graph J_{2,m}
Doost Ali Mojdeh, Arezoo Nazi Ghameshlou · International Journal of Contemporary Mathematical Sciences · 2007
Given graph 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 γ(G), γc(G),γi(G), γt(G) and γr(G) respectively in Jahangir graphs J2,m.