SUPER (a,d)-EDGE ANTIMAGIC TOTAL LABELING OF CONNECTED LAMPION GRAPH

  • Robiatul Adawiyah
  • D Dafik
  • S Slamin

Abstract

Abstract. A G graph of order p and size q is called an (a,d)-edge antimagic total if there exist a bijection f: V(G)E(G) {1,2,…,p+q} such that the edge-weights, w(uv)=f(u)+f(v)+f(uv), 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 £n,m by using deductive axiomatic and the pattern recognition method. The result shows that a connected Lampion graphs admit a super (a,d)-edge antimagic total  labeling for d = 0,1,2 for n It can be concluded that the result of this research has covered all the feasible d.

Key Words: (a,d)-edge antimagic vertex labeling, super (a,d)-edge antimagic total labeling, Lampion Graph.

 

Author Biography

Robiatul Adawiyah

SUPER (a,d)-EDGE ANTIMAGIC TOTAL LABELING OF CONNECTED LAMPION GRAPH

Robiatul Adawiyah[1], Dafik[2], Slamin[3]

Abstract. A G graph of order p and size q is called an (a,d)-edge antimagic total if there exist a bijection f: V(G)E(G) {1,2,…,p+q} such that the edge-weights, w(uv)=f(u)+f(v)+f(uv), 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 £n,m by using deductive axiomatic and the pattern recognition method. The result shows that a connected Lampion graphs admit a super (a,d)-edge antimagic total  labeling for d = 0,1,2 for n It can be concluded that the result of this research has covered all the feasible d.

Key Words: (a,d)-edge antimagic vertex labeling, super (a,d)-edge antimagic total labeling, Lampion Graph.

 


[1] Student of Mathematics Education Department  Jember University

[2] Lecturer of Mathematics Education Department  Jember University

[3] Lecturer of Information System Department Jember University

Published
2015-04-01
How to Cite
ADAWIYAH, Robiatul; DAFIK, D; SLAMIN, S. SUPER (a,d)-EDGE ANTIMAGIC TOTAL LABELING OF CONNECTED LAMPION GRAPH. Kadikma, [S.l.], v. 6, n. 1, apr. 2015. ISSN 2686-3243. Available at: <https://jurnal.unej.ac.id/index.php/kadikma/article/view/1826>. Date accessed: 25 nov. 2024. doi: https://doi.org/10.19184/kdma.v6i1.1826.
Section
Articles