Please use this identifier to cite or link to this item: http://10.9.150.37:8080/dspace//handle/atmiyauni/1022
Title: Antimagic Labeling of Some Path and Cycle Related Graphs
Authors: Vaidya, S.
Vyas, N.
Keywords: Antimagic labeling
Antimagic graph
Middle graph
Total graph
Issue Date: 2013
Publisher: Annals of Pure and Applied Mathematics
Citation: Vaidya, S. ,Vyas, N.(2013). Antimagic Labeling of Some Path and Cycle Related Graphs. Annals of Pure and Applied Mathematics , Vol. 3, No. 2, 2013, 119-128 ISSN: 2279-087X (P), 2279-0888(online) Published on 28 July 2013 www.researchmathsci.org
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.
URI: http://10.9.150.37:8080/dspace//handle/atmiyauni/1022
ISSN: 2279-0888
Appears in Collections:01. Journal Articles

Files in This Item:
File Description SizeFormat 
898) 13056_Nirav Bipinkumar Vyas.pdf310.2 kBAdobe PDFView/Open
Show full item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.