Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4651729 | Electronic Notes in Discrete Mathematics | 2015 | 5 Pages |
Abstract
An injective map f:E(G)→{±1,±2,⋯,±q} is said to be an edge pair sum labeling if the induced vertex function f⁎:V(G)→Z−{0} defined by f⁎(v)=∑eϵEvf(e) is one-one where Ev denotes the set of edges in G that are incident with a vertex v and f⁎(V(G)) is either of the form or according as p is even or odd. A graph with an edge pair sum labeling is called an edge pair sum graph. In this paper we prove that triangular snake, bistars, Cn⋃Cn and K1,n⋃K1,m are edge pair sum graphs.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics