| dc.contributor.author | DAFIK M Mirka, J Ryan, M Baca | |
| dc.date.accessioned | 2014-08-17T01:39:37Z | |
| dc.date.available | 2014-08-17T01:39:37Z | |
| dc.date.issued | 2006-07-13 | |
| dc.identifier.issn | Proceeding | |
| dc.identifier.uri | http://repository.unej.ac.id/handle/123456789/58932 | |
| dc.description | YEAR/VOLUME/NUMBER/PAGE:2006/Juli 13-19/67-75 | en_US |
| dc.description.abstract | A graph G of order p and size q is called an
(a,d)-edge-antimagic total if there exist a bijection f : V (G) U
E(G) ---> {1, 2, ...., p + q} such that the edge-weights, w(uv) =
f(u) + f(v) + f(uv); uv in E(G), form an arithmetic sequence with
first term a and common difference d. Such a graph G is called super
if the smallest possible labels appear on the vertices. In this
paper we study properties of super (a, d)-edge-antimagic total
labeling of disconnected graphs K_{1,m} U K_{1,n}. | en_US |
| dc.description.sponsorship | ARC Grant 2004-2007 Australia | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | CIAO (Center for Informatics and Applied Optimisation), ITMS (School of Information Technology and Mathematical Science), University of Ballarat Australia. | en_US |
| dc.relation.ispartofseries | The Seventeenth Australian Workshop on Combinatorial Algorithms;17 | |
| dc.subject | A D-EDGE-ANTIMAGIC TOTAL LABELING SUPER A D-EDGE-ANTIMAGIC TOTAL LABELING DISCONNECTED GRAPSH STAR GRAPHS. | en_US |
| dc.title | Super Edge-Antimagicness for a Class of Disconnected Graphs | en_US |
| dc.identifier.validator | Taufik 7 November | |
