Edge pair sum labeling of spider graph

Document Type: Research Paper

Authors

1 Research Centre, Department of Mathematics, Govindammal Aditanar College for Women Tiruchendur, Tamil Nadu, India.

2 Department of Mathematics, G. Venkataswamy Naidu College, Kovilpatti, Tamil Nadu, India.

Abstract

An injective map f : E(G) → {±1, ±2, · · · , ±q} is said to be an edge pair sum labeling of a graph G(p, q) if the induced vertex function f*: V (G) → Z − {0} defined by f*(v) = (Sigma e∈Ev) f (e) is one-one, where Ev denotes the set of edges in G that are incident with a vetex v and f*(V (G)) is either of the form {±k1, ±k2, · · · , ±kp/2} or {±k1, ±k2, · · · , ±k(p−1)/2} U {k(p+1)/2} according as p is even
or odd. A graph which admits edge pair sum labeling is called an edge pair sum graph. In this paper we exhibit some spider graph.

Keywords

Journal of Algorithms and Computation

Volume 45, Issue 1
December 2014
Pages 25-34

Files

Share

How to cite

Statistics