Please use this identifier to cite or link to this item: http://10.9.150.37:8080/dspace//handle/atmiyauni/1022
Full metadata record
DC FieldValueLanguage
dc.contributor.authorVaidya, S.-
dc.contributor.authorVyas, N.-
dc.date.accessioned2023-05-20T02:44:31Z-
dc.date.available2023-05-20T02:44:31Z-
dc.date.issued2013-
dc.identifier.citationVaidya, 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.orgen_US
dc.identifier.issn2279-0888-
dc.identifier.urihttp://10.9.150.37:8080/dspace//handle/atmiyauni/1022-
dc.description.abstractAn 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.isoenen_US
dc.publisherAnnals of Pure and Applied Mathematicsen_US
dc.subjectAntimagic labelingen_US
dc.subjectAntimagic graphen_US
dc.subjectMiddle graphen_US
dc.subjectTotal graphen_US
dc.titleAntimagic Labeling of Some Path and Cycle Related Graphsen_US
dc.typeArticleen_US
Appears in Collections:01. Journal Articles

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


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