Time filter

Source Type

Kalaimurugan G.,Thiruvalluvar University | Kalaimurugan G.,Indian arts and science college | Jayakumar R.,Thiruvalluvar University | Jayakumar R.,Indian arts and science college
International Journal of Applied Engineering Research | Year: 2015

Let G be a simple connected graph with vertex set V(G) and edge set E(G). A function f:E(G)→{-1,1} is called the signed edge domination fuction (SEDF) of G if ∑eʹϵN[e] f(eʹ) ≥ 1 for every e ϵ E(G), where N(e) U {e}, N(e) is the set of all edges adjacent to. The signed edge domination number γʹs(G) of G is defined as γʹs(G) = min {∑eϵE(G) f(e)|f is an SEDF of G}. In this paper, we obtain exact values for the signed edge domination number of certain class of circulant graphs. Keywords: signed edge domination, signed edge dominating number, circulant graph. © Research India Publications.

Loading Indian arts and science college collaborators
Loading Indian arts and science college collaborators