Claim Missing Document
Check
Articles

Found 5 Documents
Search
Journal : KADIKMA

SUPER (a,d)-EDGE ANTIMAGIC TOTAL LABELING OF CONNECTED TRIBUN GRAPH Mahmudah, Muhlisatul; 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 (614.369 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 Tribun graph. The result shows that a connected Tribun graph admit a super(a,d)-edge antimagic total labeling ford=0,1,2 for n≥1. It can be concluded that the result of this research has covered all the feasible n,d. Key Words: (a,d)-edge antimagic vertex labeling, super(a,d)-edge antimagic total labeling, Tribun Graph.  
Aplikasi Teori Dominasi Jarak Satu Pada Penempatan SPBU Di Kabupaten Jember Mahmudah, Muhlisatul
Kadikma Vol 13 No 1 (2022): April 2022
Publisher : Department of Mathematics Education , University of Jember

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

Abstract

Many Public Gas Stations (SPBU) in Jember Regency has an impact on the inefficiency of Jember Regency area which should be used for other developments which also benefit the community. Therefore, this research useful to investigate the dominating number of one distance in the shackle operation graph that is shackle (), and the placement of SPBU in Jember Regency so that its placement can reach all areas of Jember Regency. This research uses axiomatic deductive method and pattern detection, which determine the dominating sets in a way that the minimum cardinality is found and produces new theorems that have been deductively proven so the truth is generally valid.
PENGEMBANGAN INSTRUMEN KEMAMPUAN BERPIKIR ANALISIS SISWA SMP DALAM MENYELESAIKAN SOAL PEMECAHAN MASALAH MATEMATIKA Irawati, Tri Novita; Mahmudah, Muhlisatul
Kadikma Vol 9 No 2 (2018): Agustus 2018
Publisher : Department of Mathematics Education , University of Jember

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

Abstract

Abstract. This study aimed to describe the process and to develop analytical thinking ability instruments referring to the Thiagarajan Model known as the Four-D Model (Model 4-D). The Thiagarajan Model consists of four stages: define, planning, design, and disseminate stages. Data analysis consisted of instrument validation analysis, instrument reliability, practicality and effectiveness of instruments and analysis of teacher response data on the results of instrument development. Based on the results of the analysis, the instrument developed reached high level of instrument validation by experts with a validity coefficient of 0.748 and high level of instrument reliability with a reliability coefficient of 0.78. In addition, the degree of practicality was in the high category with a degree of coefficient (IP) = 4. It also reached high degree of effectiveness with a degree of coefficient (IE) = 4.6. The teacher's response to the development of the instrument was very good with a teacher response of 90%. Keywords: Analytical thinking skills, problem solving questions
APLIKASI PEWARNAAN GRAF TERHADAP PEMBUATAN JADWAL UJIAN SEMESTER DI JURUSAN PENDIDIKAN MATEMATIKA UNIVERSITAS ISLAM JEMBER Mahmudah, Muhlisatul; Irawati, Tri Novita
Kadikma Vol 9 No 2 (2018): Agustus 2018
Publisher : Department of Mathematics Education , University of Jember

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

Abstract

Abstract. Islamic University of Jember is a private university that organizes education in the Jember city. The implementation of the student exam at Islamic University of Jember, especially Mathematics education, is held 2 (two) times at years, that are the exam in old semester and the exam in even semester. Each exam will be guarded by 1 (one) lecturer, while 1 lecturer can be a examiner for several semester exam in one day, so that in the preparation of the thesis examination schedule must consider the time availability of each lecturer who will test. The preparation of the semester examination schedule at the Islamic University of Jember in mathematics education is manually, so that the overlapping semester exam schedule is still found. The overlapping exam schedule resulted in the implementation of the exam not being maximal, so that a technique was needed in the preparation of the thesis examination schedule. One technique that can be used to form a schedule is vertex coloring graph. The results of this study show that vertex coloring can be applied in making the semester examination schedule by giving better scheduling results than the previous method. The resulting semester exam schedule no longer shows an overlapping exam schedule so that the implementation of the semester exam runs better. Keyword : Scheduling, Vertex Coloring, Exams.
SUPER (a,d)-EDGE ANTIMAGIC TOTAL LABELING OF CONNECTED TRIBUN GRAPH Mahmudah, Muhlisatul; 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.1834

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 Tribun graph. The result shows that a connected Tribun graph admit a super(a,d)-edge antimagic total labeling ford=0,1,2 for n≥1. It can be concluded that the result of this research has covered all the feasible n,d. Key Words: (a,d)-edge antimagic vertex labeling, super(a,d)-edge antimagic total labeling, Tribun Graph.