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 69 Documents
Search

 3   4   5   6   7 
NILAI KETAKTERATURAN TOTAL SISI DARI GRAF TANGGA PERMATA Hanani, Hilmiyah; Slamin, S; Dafik, D
Kadikma Vol 5 No 1 (2014): April 2014
Publisher : Department of Mathematics Education , University of Jember

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

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)
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 (2013): Agustus 2013
Publisher : Department of Mathematics Education , University of Jember

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

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
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.  
NILAI KETAKTERATURAN TOTAL SISI DARI GRAF TANGGA (STAIR GRAPH) Wulandari, Septiyani Setyo; Slamin, S; Setiawani, Susi
Kadikma Vol 5 No 2 (2014): Agustus 2014
Publisher : Department of Mathematics Education , University of Jember

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

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).
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.
NILAI KETAKTERATURAN TOTAL SISI DARI GRAF SIPUT Novindasari, Shapbian; Slamin, S; Dafik, D
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.1833

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.  
Penerapan Metode Certainty Factor Untuk Sistem Pakar Diagnosis Hama Dan Penyakit Pada Tanaman Tembakau Arifin, Mohammad; Slamin, S.; Retnani, Windi Eka Yulia
BERKALA SAINSTEK Vol 5 No 1 (2017)
Publisher : Universitas Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/bst.v5i1.5370

Abstract

Proses budidaya tanaman tembakau dipengaruhi oleh berbagai faktor, salah satunya adalah faktor hama dan penyakit. Umumnya, masalah petani membedakan antara hama dan penyakit, hal ini karena sebagian besar petani kekurangan informasi dan masih mengandalkan pengalaman petani lain untuk mengatasi masalah hama dan penyakit yang ada. Sering terjadi kesalahan dalam membedakan antara hama dan penyakit, seperti hama diberantas dengan obat untuk penyakit (fungisida), sebaliknya, penyakit diberantas dengan obat hama (insektisida). Sebagai hasil dari hama dan penyakit yang tidak terkontrol dan terus menyerang tanaman, sehingga merugikan banyak biaya dan usaha. Pada penanganan hama dan penyakit, dibutuhkan konsultan pertanian yang mampu mendiagnosa hama dan penyakit pada tanaman tembakau. Dalam penelitian ini, sistem pakar diagnosis hama dan penyakit pada tanaman tembakau dibangun untuk membantu mendiagnosa jenis hama atau penyakit yang menyerang tanaman tembakau, serta memberikan berbagai solusi untuk hama atau penyakit. Metode yang digunakan pada sistem pakar ini adalah metode Certainty Factor. Metode Certainty Factor dipilih karena metode ini cocok dalam proses penentuan identifikasi hama dan penyakit, dan hasil dari penerapan metode ini adalah persentase. Persentase sistem disini merupakan tingkat akurasi penentuan penyakit atau hama yang menjangkiti tanaman tembakau. Penentuan persentase dipengaruhi oleh nilai MB yang didapat dari sistem dan nilai MD yang didapat dari penilaian seorang pakar. Berdasarkan penelitian yang dilakukan, penentuan hama atau penyakit yang menyerang tanaman tembakau dipengaruhi oleh pemilihan gejala. Persentase pada konsultasi sistem pakar diambil dari hasil tertinggi pertama dan kedua, sebagai alternatif hama lain atau penyakit yang menyerang tanaman tembakau. Kata Kunci: Hama dan Penyakit, Sistem Pakar, Certainty Factor, Tembakau
Efektivitas Algoritma Kruskal dalam Mengoptimalkan Jalur Terpendek pada Jaringan Intranet Ar Ruhimat, Qurrota A'yuni; Slamin, Slamin; Malinda, Alvira
JSN : Jurnal Sains Natural Vol. 2 No. 3 (2024): Agustus
Publisher : Puslitbang Sekawan Institute Nusa Tenggara

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35746/jsn.v2i3.546

Abstract

This research takes a case study at the Communication and Information Service, Bondowoso Regency, which is one of the media for conveying information and connecting interactive communication between the government and the community. In the process of conveying information to the public, they utilize information technology, the Intranet Network. The problem found was that there were obstacles in ineffective cable installation. This relates to non-optimality in determining the shortest path between two points in an intranet network, and how to determine the correct wiring position, so that the amount used is minimal but can still function optimally and be connected to all computers. To overcome the problems above, in this research the Kruskal Algorithm will be applied which is one of the network optimization methods in Graph Theory. Graph Theory is one of fields in Mathematics that studies the relationships between objects and how these objects interact with each other. Meanwhile, the Kruskal algorithm is an algorithm used to find the shortest path between two points in a graph. It is hoped that this research can optimize the amount of cabling used in designing intranet network topologies so that we can design optimal intranet routes with minimal costs.
On inclusive distance vertex irregularity strength of book graph Wahyu, Ria Ammelia; Santoso, Kiswara Agung; Slamin, Slamin
Indonesian Journal of Combinatorics Vol 7, No 2 (2023)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/ijc.2023.7.2.4

Abstract

The concept of distance vertex irregular labeling of graphs was introduced by Slamin in 2017. The distance vertex irregular labeling on a graph G with v vertices is defined as an assignment λ : V → {1, 2, ..., k} so that the weights calculated at vertices are distinct. The weight of a vertex x in G is defined as the sum of the labels of all the vertices adjacent to x (distance 1 from x). The distance vertex irregularity strength of graph G, denoted by dis(G), is defined as the minimum value of the largest label k over all such irregular assignments. Bong, Lin and Slamin generalized the concept to inclusive and non-inclusive distance irregular labeling. The difference between them depends on the way to calculate the weight on the vertex whether the vertex label we calculate its weight is included or not. The inclusive distance vertex irregularity strength of G, is defined as the minimum of the largest label k over all such inclusive irregular assignments. In this paper, we determine the inclusive distance vertex irregularity strength of some particular classes of graphs such as book 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