Abstract
For a graph , a bijection from is called -edge-antimagic total (-EAT) labeling of if the edge-weights , form an arithmetic progression starting from and having a common difference , where and are two fixed integers. An -EAT labeling is called super -EAT labeling if the vertices are labeled with the smallest possible numbers; that is, . In this paper, we study super -EAT labeling of cycles with some pendant edges attached to different vertices of the cycle.
Citation
Himayat Ullah. Gohar Ali. Murtaza Ali. Andrea Semaničová-Feňovčíková. "On Super -Edge-Antimagic Total Labeling of Special Types of Crown Graphs." J. Appl. Math. 2013 1 - 6, 2013. https://doi.org/10.1155/2013/896815
Information