Super (a, d)-Edge Antimagic Total Labeling of Connected Ferris Wheel Graph
| Main Authors: | Sumarno, Djoni Budi, Dafik, D, Santoso, Kiswara Agung |
|---|---|
| Format: | Article info application/pdf eJournal |
| Bahasa: | eng |
| Terbitan: |
Fakultas Matematika dan Ilmu Pengetahuan Alam Universitas Jember
, 2015
|
| Online Access: |
https://jurnal.unej.ac.id/index.php/JID/article/view/1051 https://jurnal.unej.ac.id/index.php/JID/article/view/1051/1446 |
Daftar Isi:
- Let G be a simple graph of order p and size q. Graph G is called an (a,d)-edge-antimagic totalifthereexistabijectionf :V(G)âŞE(G)â{1,2,...,p+q}suchthattheedge-weights,w(uv)= f(u)+f(v)+f(uv); u, v â V (G), uv â 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 connected of Ferris Wheel F Wm,n by using deductive axiomatic method. The results of this research are a lemma or theorem. The new theorems show that a connected ferris wheel graphs admit a super (a, d)-edge antimagic total labeling for d = 0, 1, 2. It can be concluded that the result of this research has covered all feasible d. Key Words : (a, d)-edge antimagic vertex labeling, super (a, d)-edge antimagic total labeling, Ferris Wheel graph FWm,n.