Article Per Year (5 Year)
p-Index From 2021 - 2026
1.288
P-Index
This Author published in this journals
All Journal Jurnal Edukasi Universitas Jember KADIKMA CAUCHY: Jurnal Matematika Murni dan Aplikasi EDU-MAT: Jurnal Pendidikan Matematika BAREKENG: Jurnal Ilmu Matematika dan Terapan Unisda Journal of Mathematics and Computer Science (UJMC) Contemporary Mathematics and Applications (ConMathA) CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Ermita Rizki Albirri
Universitas Jember
Computer Science & IT Control & Systems Engineering Economics, Econometrics & Finance Education Energy Engineering Materials Science & Nanotechnology Mathematics Mechanical Engineering Physics Transportation Other

Published : 14 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : KADIKMA

 1 
SUPER (a,d)-EDGE ANTIMAGIC TOTAL LABELING OF PENTAGONAL CHAIN GRAPH Albirri, Ermita Rizki; Dafik, D; Slamin, S
KadikmA Vol 6, No 1: April 2015
Publisher : KadikmA

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (486.346 KB)

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 PCn by using deductive axiomatic and the pattern recognition method. The result shows that a connected pentagonal chain 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, Pentagonal Chain Graph.
SUPER (a,d)-EDGE ANTIMAGIC TOTAL LABELING OF PENTAGONAL CHAIN GRAPH Albirri, Ermita Rizki; Dafik, D; Slamin, S
Kadikma Vol 6 No 1 (2015): April 2015
Publisher : Department of Mathematics Education , University of Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/kdma.v6i1.1824

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 PCn by using deductive axiomatic and the pattern recognition method. The result shows that a connected pentagonal chain 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, Pentagonal Chain Graph.
Co-Authors Afni, Anis Nur Ambarwati, Reza Arika Indah Kristiana Bayu Aprilianto D. Dafik Dafik Dafik Deddy Setyawan Firman Firman Husain, Sharifah Kartini Said Khilyah Munawaroh Quthrotul Aini Fuidah Rafiantika Megahnia Prihandini Reza Ambarwati Riniatul Nur Wahidah Riniatul Nur Wahidah Robiatul Adawiyah S Slamin Sharifah Kartini Said Husain Surya Indriani Wahidah, Riniatul Nur