Antimagic Labeling in the Context of Switching of a  Vertex

Vaidya, S.; Vyas, N.

dc.contributor.author	Vaidya, S.
dc.contributor.author	Vyas, N.
dc.date.accessioned	2023-05-20T02:14:15Z
dc.date.available	2023-05-20T02:14:15Z
dc.date.issued	2012
dc.identifier.citation	Vaidya, S. ,Vyas, N.(2012). Antimagic Labeling in the Context of Switching of a Vertex. Annals of Pure and Applied Mathematics Vol. 2, No. 1, 2012, 33-39 ISSN: 2279-087X (P), 2279-0888(online) Published on 11 December 2012 www.researchmathsci.org	en_US
dc.identifier.issn	2279-0888
dc.identifier.uri	http://10.9.150.37:8080/dspace//handle/atmiyauni/1019
dc.description.abstract	A graph with q edges is called antimagic if its edges can be labeled with 1, 2,…,q such that the sums of the labels of the edges incident to each vertex are distinct. Here we prove that the graphs obtained by switching of a pendant vertex in path Pn, switching of a vertex in cycle Cn, switching of a rim vertex in wheel Wn, switching of an apex vertex in helm Hn and switching of a vertex of degree 2 in fan fn admit antimagic labeling.	en_US
dc.language.iso	en	en_US
dc.publisher	Annals of Pure and Applied Mathematics	en_US
dc.subject	Switching of a vertex	en_US
dc.subject	Antimagic labeling	en_US
dc.subject	Antimagic graphs	en_US
dc.title	Antimagic Labeling in the Context of Switching of a Vertex	en_US
dc.type	Article	en_US