Domination in Jahangir graph J_{2,m}

• DOI: 10.12988/ijcms.2007.07122
• Publication Date: 2016-05-09T05:33:45Z
• Authors: D. A. Mojdeh; A. N. Ghameshlou
• Keywords: 0102 computer and information sciences; 01 natural sciences

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