Abstract:
An edge labeling of a graph is a bijection from E(G) to the set {1,2,… , |E(G)|}.
If for any two distinct vertices u and v, the sum of labels on the edges incident to u is
different from the sum of labels on the edges incident to v then an edge labeling is called
antimagic labeling. We investigate antimagic labeling for some path and cycle related
graphs.
