| dc.contributor.author | Dafik, Slamin, M Fuad, Riris R.R | |
| dc.date.accessioned | 2014-08-17T01:56:53Z | |
| dc.date.available | 2014-08-17T01:56:53Z | |
| dc.date.issued | 2009-10-12 | |
| dc.identifier.issn | Proceeding (ISBN 978-602-96426-0-5) | |
| dc.identifier.uri | http://repository.unej.ac.id/handle/123456789/58934 | |
| dc.description | YEAR/VOLUME/NUMBER/PAGE:2009/October 12-13/48 | 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 super (a, d)-edge-antimagic total properties of
disconnected graphs triangular ladder and lobster. | en_US |
| dc.description.sponsorship | DP2M Dikti 2009 | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Indoms Indonesian Mathematics Society | en_US |
| dc.relation.ispartofseries | IICMA (Indoms International Conference on Mathematics and Its Applications);2009 | |
| dc.subject | a, d-edge-antimagic total labeling, super a, d-edge-antimagic total labeling, triangular ladder, lobster graph | en_US |
| dc.title | Super Edge-antimagic Total Labeling of Disjoint Union of Triangular Ladder and Lobster Graphs | en_US |
| dc.type | Article | en_US |
