Super (a, d)-Edge Antimagic Total Labeling of Connected Ferris Wheel Graph
| Autor: | Kiswara Agung Santoso, D Dafik, Djoni Budi Sumarno |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2015 |
| Předmět: | |
| Zdroj: | Jurnal Ilmu Dasar, Vol 15, Iss 2, Pp 123-130 (2015) |
| ISSN: | 2442-5613 1411-5735 |
| Popis: | Let G be a simple graph of order p and size q . Graph G is called an ( a,d ) -edge-antimagic total ifthereexistabijection f : 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 W m,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 FW m,n . |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|