Article Per Year (5 Year)
p-Index From 2021 - 2026
1.259
P-Index
This Author published in this journals
All Journal Jurnal Ilmu Dasar Jurnal Edukasi Universitas Jember KADIKMA BERKALA SAINSTEK CAUCHY: Jurnal Matematika Murni dan Aplikasi Electronic Journal of Graph Theory and Applications (EJGTA) Saintifika Journal of Mathematical and Fundamental Sciences Prosiding Seminar Matematika dan Pendidikan Matematik INFORMAL: Informatics Journal JURNAL NASIONAL TEKNIK ELEKTRO UNEJ e-Proceeding Proceeding of the Electrical Engineering Computer Science and Informatics Prosiding SI MaNIs (Seminar Nasional Integrasi Matematika dan Nilai-Nilai Islami) Kinetik: Game Technology, Information System, Computer Network, Computing, Electronics, and Control Limits: Journal of Mathematics and Its Applications International Journal of Supply Chain Management Indonesian Journal of Combinatorics CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Pancaran Pendidikan SAINTIFIKA Jurnal Sains Natural
S Slamin
CGANT University Of Jember Indonesia; System Information. Depart. University Of Jember
Agriculture, Biological Sciences & Forestry Arts Humanities Astronomy Biochemistry, Genetics & Molecular Biology Chemical Engineering, Chemistry & Bioengineering Chemistry Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Earth & Planetary Sciences Education Electrical & Electronics Engineering Energy Engineering Environmental Science Health Professions Industrial & Manufacturing Engineering Languange, Linguistic, Communication & Media Mathematics Medicine & Pharmacology Nursing Physics Public Health Social Sciences Transportation Other

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

Found 25 Documents
Search
Journal : KADIKMA

 1   2   3 
PENGEMBANGAN PERANGKAT PEMBELAJARAN MATEMATIKA BERBASIS PENDEKATAN INVESTIGASI BERBANTUAN E-LEARNING DENGAN APLIKASI MOODLEPADA SUBPOKOK BAHASAN TRIGONOMETRI KELAS X SMA Rohmatullah, R; Dafik, D; Slamin, S
KadikmA Vol 4, No 2: Agustus 2013
Publisher : KadikmA

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

Abstract

Abstract.The research aims toknow process and result of developing of mathematics learning intruments based on investigation approach and assistede-learning with LMS Moodle fortrigonometry topic at tenthgrade ofseniorhigh school. The research development modle refers to4D Thiagarajan models. The subject of research is students of X2 class SMAN Rambipuji in even semester academic year 2012-2013. The data of research are obtained by validation sheet, observation sheet of teacher and students activities, questionnaire, and evaluation test.Theproduct of thisresearch are lesson plan, student handbook, worksheet, evaluation test, and e-learning site.The result shows that the learning instrumentsqualifies validity, practical, and effective criteria. Key Words:Investigation approach, e-learning, LMS Moodle, trigonometry
PENGEMBANGAN PERANGKAT PEMBELAJARAN MATEMATIKA BERBASIS WEB MODEL KOOPERATIF TIPE STAD DENGAN APLIKASI MOODLE SUB POKOK BAHASAN SEGITIGA UNTUK SISWA SMP KELAS VII Sholihah, Siti Mar’atus; Slamin, S; Dafik, D
KadikmA Vol 5, No 1: April 2014
Publisher : KadikmA

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

Abstract

Abstract.Web based learning is attractive and innovative learning that can be used in class. The goal of the research is to know about process and result of developing of mathematics learning instrument based on web cooperative model type STAD with moodle application for triangle topic grade VII junior high shool. The research used developmental model Plomp. The subject of the research is student of VIIA in MTs Al Qodiri I Jember for even semester 2012/2013 academic year. The datas is validation sheets, activities of student and teacher’s observation sheets, questionner,and evaluation test. The products of the research are lesson plan, student worksheet, student book, evaluation test, and learning media.The result of this research is the learning instrument that developed is valid, pragmatic, and effective. Key Words:STAD, e-learning, LMS Moodle, triangle
NILAI KETAKTERATURAN TOTAL SISI DARI GRAF TANGGA PERMATA Hanani, Hilmiyah; Slamin, S; Dafik, D
KadikmA Vol 5, No 1: April 2014
Publisher : KadikmA

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

Abstract

Abstract. Let graph G = (V,E) has V vertices and E edges. For every two different edges of graph G has total irregularity strength labelling ofG ifωt(e) ≠ ωt(f) where graph G = (V,E) has V vertices and E edges. The weight edge ofxy of a graph G is 𝜔(xy) =𝜆x) +𝜆xy) + 𝜆y) where 𝜆x) is the label vertex x and 𝜆y) is the label vertex y and 𝜆xy) is the label edge of the xy. The minimum value on the biggest labels make a graph G, has irregular labeling which is defined as total edge irregularity strength and denoted by tes(G). In this article, The total edge irregularity strength of diamond ladder graph and the union of diamond ladder graphs (isomorphic) are determined. The diamond ladder graph, denoted by Dln, is a graph consisting ofn diamond (n ≥2) . Key Words : Total edge irregularity strength, Diamond Ladder Graph (Dln)
NILAI KETAKTERATURAN TOTAL SISI DARI GRAF TANGGA (STAIR GRAPH) Wulandari, Septiyani Setyo; Slamin, S; Setiawani, Susi
KadikmA Vol 5, No 2: Agustus 2014
Publisher : KadikmA

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

Abstract

Abstract. The total edges labelling λ is called an edge irregular total k-labelling of a graph G if every two distinct edges u and v in G ωt(u)≠ωt(v). The total edge irregularity strength of G is the minimum positive integer k for which G has a total edge irregular k-labelling. There are not many graphs of which their total edge irregularity strengths are known. In this article, we investigate the total edge irregularity strength of Stair Graph tes(Stn) and union of m isomorphic Stair Graphs tes(mStn). Key Words: Total edge irregularity strength, Stair Graph (Stn).
NILAI KETAKTERATURAN TOTAL SISI DARI GRAF TUNAS KELAPA A, Moch. Zaenal; Slamin, S; Setiawani, Susi
KadikmA Vol 5, No 3: Desember 2014
Publisher : KadikmA

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

Abstract

Abstract. A total edge irregular labeling on a graph G which has |E| edges and |V| vertices is an assignment of positive integer number as labels to both vertices and edges so that the weights calculated at every edges are distinct. The weight of an edge xy in G is defined as the sum of the label of xy and the labels of two vertices x and y, that is w(xy) = (x)+ (xy)+ (y). The total edge irregularity strength of G, denoted by tes(G), is the smallest positive integer k for which G has an edge-irregular total k-labelling. In this paper, we determine the exact value of the total edge (vertex) irregularity strength of Coconut Sprout Graph (CRn,m) and the union of isomorphic and non-isomorphic Coconut Sprout Graph. Key Words : total edge irregular labeling, total edge irregularity strength, coconut sprout graph.
NILAI KETAKTERATURAN TOTAL SISI DARI GRAF SEGITIGA BERMUDA Anjelia, Novalita; Slamin, S; Dafik, D
KadikmA Vol 5, No 3: Desember 2014
Publisher : KadikmA

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

Abstract

Abstract.For a simple graph G, a labelling λ∶V(G)∪E(G)→ {1,2,…,k} is called an edge irregular total k-labelling of G if for any two different edges e and f of G there is, wt(e)≠wt(f). The total edge irregularity strength denoted by tes G is the smallest positive integer k for which G has an edge irregular total k-labelling. In this paper, we consider the total edge irregularity strength of Bermuda Triangle graph and the union isomorphic and non isomorphic Bermuda Triangle graph. We show that tes(〖Btr〗_(n,4) )= ⌈(30n+17)/3⌉, for n≥1, tes(〖sBtr〗_(n,4) )=⌈(s(30n+15)+ 2)/3⌉, for n≥1 and s≥2, and tes(〖Btr〗_(n,4)∪〖Btr〗_(m,4) )=⌈((30n+15)+ (30m+15)+ 2)/3⌉, for 1≤n≤m. Keywords:Edge irregular total labelling, Irregularity strength, Total edge irregularity strength, Bermuda Triangle graph.
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 CONNECTED LAMPION GRAPH Adawiyah, Robiatul; 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 (613.57 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 £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.  
SUPER (a,d)-EDGE-ANTIMAGIC TOTAL LABELING OF SILKWORM GRAPH Hadi, Dian Anita; 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 (523.465 KB)

Abstract

Abstract. An  (a, d)-edge-antimagic  total   labeling  of G  is a  one-to-one  mapping taking the vertices and edges onto {1, 2, 3, . . . , p + q} Such that the edge-weights w(uv)  = (u)+(v)+(uv), uv ∈ E(G)  form an arithmetic sequence {a, a+d, a+2d, . . . , a+ (q − 1)d}, where first term  a > 0 and  common  difference d ≥ 0.  Such a graph G is called super if the smallest possible labels appear on the vertices.  In this paper we will study a super edge-antimagic total labelings properties of connective Swn graph.   The result shows that a connected Silkworm graph 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 the feasible n, d.   Key Words: (a, d)-edge-antimagic total labeling, super (a, d)-edge-antimagic total labeling, Silkworm graph.
NILAI KETAKTERATURAN TOTAL SISI DARI GRAF SIPUT Novindasari, Shapbian; Slamin, S; Dafik, D
KadikmA Vol 6, No 1: April 2015
Publisher : KadikmA

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

Abstract

Abstract. Let G=(V,E) be a simple graph, a labeling is called an edge irregular total k-labelling of G if for any two different edges e and f of G there is, . The total edge irregularity strength denoted by tes G is the smallest positive integer k for which G has an edge irregular total k-labelling. In this paper, we will determine the total edge irregularity strengths of a Snail graph, the union isomorphic and non-isomorphic union of Snail graph, and shackle graph of Snail graph. We show that , for , , for and , , for where natural numbers, and , for and Key Words: Total edge irregular labeling, Total edge irregularity strength, Snail graph.  
Co-Authors Abdul Rouf Alghofari Agustina M. Andrea Semanicova-Fenovcikova Antonius Cahya Prihandoko Ar Ruhimat, Qurrota A'yuni Arif Fatahillah Arifin, Mohammad D. Dafik Desy Nurjannah Desy Tri Puspasari Desy Tri Puspasari, Desy Tri Dian Anita Hadi, Dian Anita Diari Indriati Diksy Media Firmansyah Dinawati Trapsilasiwi Dzurrotun Nasyika Ermita Rizki Albirri Faisal Susanto Gembong A. W. Hardja, Ivan Hidayat, Noor Hilmiyah Hanani I Wayan Sudarsana Ika Hesti Agustin, Ika Hesti Inge Yosanda Arianti, Inge Yosanda Irma Azizah Ivan Hardja Juniar Priaditama Kiki A. Sugeng Kristiana Wijaya Kristiana Wijaya Kusbudiono Kusbudiono, Kusbudiono Liliek Susilowati Lubis Muzaki Lusia Dewi Minarti Lusia Dewi Minarti M, Nurul Istiana M. Utomo Malinda, Alvira Martin Baca Mirka Miller Moch Bustommy Maulana Moch. Zaenal A Moh Febri Nurul Qorik Moh. Hasan Mohammad Imam Utoyo Mohammad Zarkasi Muhlisatul Mahmudah, Muhlisatul Nova El Maidah Novalita Anjelia Nuris Hisan Nazula Nurul Istiana M Oktalia Juwita Oktavia, Nelly Prabhu, Savari Priza Pandunata Qurrotul A’yun R Rohmatullah Robiatul Adawiyah Robiatul Adawiyah Rukmana Sholehah, Rukmana S. M. Yunika Safira Izza Ghafrina Safira Izza Ghafrina Saiful Bukhori Santoso, Kiswara Agung Septiyani Setyo Wulandari Shapbian Novindasari, Shapbian Sholihah, Siti Mar’atus Siti Mar’atus Sholihah Sulistio, Wahyu Susi Setiawani Tanti Windartini, Tanti Tri Mulyani Tri Mulyani Umilasari, Reni Wahyu, Ria Ammelia Wijayanti, Dian Eka Wiji Utami Windi Eka Yulia Retnani Yanuar Nurdiansyah, Yanuar Yayuk Wahyuni Yudha Alif Auliya