EDGE ISOLATED DOMINATION FOR JAHANGIR GRAPHS

Let G = (V, E) be a non trivial finite graph with vertex set V and edge set E. A subset S of V in a graph G is said to be an edge -dominating set if every edges in G is incident with a vertex in S. A edge dominating set S such that (S) has an isolated vertex or (V S) is a single vertex is called edge isolated dominating set [3]. The minimum cardinality number of a edge isolated dominating set is called the edge isolated dominating number of a Graph. Jahangir graphs for s 2, m 2, is a graph on sm + 1 vertices consisting of a cycle Csm with one additional vertex which is adjacent to m vertices of Csm at distance s to each other on Csm. The definition of Jahangir graph J2 m was introduced by Surahmat and Tomescu in [1]. In this paper we obtained the edge isolated dominating number of a Jahangir graphs Js, with different combinations on their adjacency and distances and some results based on it.