On Super -Edge-Antimagic Total Labeling of Special Types of Crown Graphs

Himayat Ullah, Gohar Ali, Murtaza Ali and Andrea Semaničová-Feňovčíková

Journal of Applied Mathematics, 2013, vol. 2013, 1-6

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.

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/JAM/2013/896815.pdf (application/pdf)
http://downloads.hindawi.com/journals/JAM/2013/896815.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnljam:896815

DOI: 10.1155/2013/896815

Access Statistics for this article

More articles in Journal of Applied Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().