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.
