On Super (a, d)-Edge-Antimagic Total Labeling of A Class of Trees

Simple item page
dc.contributor.authorA.Raheem
dc.contributor.authorA.Q.Baig
dc.contributor.authorM.Javaid
dc.date.accessioned2015-03-06T07:34:42Z
dc.date.available2015-03-06T07:34:42Z
dc.date.issued2014
dc.description.abstractThe concept of labeling has its origin in the works of Stewart (1966), Kotzig and Rosa (1970). Later on Enomoto, Llado, Nakamigawa and Ringel (1998) defined a super (a, 0)-edge-antimagic total labeling and proposed the conjecture that every tree is a super (a, 0)-edge-antimagic total graph. In the favour of this conjecture, the present paper deals with different results on antimagicness of a class of trees, which is called subdivided stars.en_US
dc.identifier.citation31. Raheem, A. Q. Baig, M. Javaid. (2014) "On Super (a, d)-Edge-Antimagic Total Labeling of A Class of Trees" International J.Math. Combin. Vol.4(2014), 47-55en_US
dc.identifier.urihttps://escholar.umt.edu.pk/handle/123456789/1442
dc.language.isoenen_US
dc.publisherInternational J.Math. Combinen_US
dc.titleOn Super (a, d)-Edge-Antimagic Total Labeling of A Class of Treesen_US
dc.typeArticleen_US
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
On Super (a, d)-Edge-Antimagic Total Labeling of.pdf
Size:
113.1 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Department of Mathematics