Volume 7 | Number 2 | Year 2014 | Article Id. IJMTT-V7P514 | DOI : https://doi.org/10.14445/22315373/IJMTT-V7P514
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)=∑_(e∊E_v)▒f(e) is one – one, where E_v denotes the set of edges in G that are incident with a vertex v and f^* (V(G)) is either of the form {±k_1,±k_2,…,±k_(p/2) } or {±k_1,±k_2,…,〖±k〗_((p-1)/2) }⋃{k_(p/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 prove that some cycle related graphs are edge pair sum graphs.
[1] J. Gross and Yellen, Graph theory and its applications, CRS Press, (1999).
[2] Joseph A. Gallian, A Dynamic Survey of Graph Labeling, The Electronic Journal of Combinatorics, (2013)
[3] P.Jeyanthi, T.Saratha Devi, Journal of Scientific Research, “Edge Pair Sum Labeling”, Vol.5 No.3 (2013), 457-467.
[4] P.Jeyanthi, T.Saratha Devi, “Some edge pair sum graph” (Preprint).
[5] P.Jeyanthi, T.Saratha Devi, “Some results on edge pair sum labeling”( Preprint).
[6] P.Jeyanthi, T.Saratha Devi, “Edge pair sum labeling of spider graph ”( Preprint).
[7] R. Ponraj and J. V. X. Parthipan, “Pair Sum Labeling of Graphs,” The Journal of Indian Academy of Mathematics, Vol. 32, No. 2, (2010), 587-595.
P. Jeyanthi , T. Saratha Devi, "On Edge Pair Sum Labeling of Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 7, no. 2, pp. 106-113, 2014. Crossref, https://doi.org/10.14445/22315373/IJMTT-V7P514