Antimagic Labeling of Some Path and Cycle Related  Graphs

Vaidya, S.; Vyas, N.

dc.contributor.author	Vaidya, S.
dc.contributor.author	Vyas, N.
dc.date.accessioned	2023-05-20T02:44:31Z
dc.date.available	2023-05-20T02:44:31Z
dc.date.issued	2013
dc.identifier.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	en_US
dc.identifier.issn	2279-0888
dc.identifier.uri	http://10.9.150.37:8080/dspace//handle/atmiyauni/1022
dc.description.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.	en_US
dc.language.iso	en	en_US
dc.publisher	Annals of Pure and Applied Mathematics	en_US
dc.subject	Antimagic labeling	en_US
dc.subject	Antimagic graph	en_US
dc.subject	Middle graph	en_US
dc.subject	Total graph	en_US
dc.title	Antimagic Labeling of Some Path and Cycle Related Graphs	en_US
dc.type	Article	en_US