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 
Total distance vertex irregularity strength of some corona product graphs Dian Eka Wijayanti; Noor Hidayat; Diari Indriati; Abdul Rouf Alghofari; Slamin Slamin
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 11, No 1 (2023): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2023.11.1.17

Abstract

A distance vertex irregular total k-labeling of a simple undirected graph G = G(V, E), is a function f : V(G)∪E(G)→{1, 2, …, k} such that for every pair vertices u, v ∈ V(G) and u ≠ v, the weights of u and v are distinct. The weight of vertex v ∈ V(G) is defined to be the sum of the label of vertices in neighborhood of v and the label of all incident edges to v. The total distance vertex irregularity strength of G (denoted by tdis(G)) is the minimum of k for which G has a distance vertex irregular total k-labeling. In this paper, we present several results of the total distance vertex irregularity strength of some corona product graphs.
On the Dominant Local Resolving Set of Vertex Amalgamation Graphs Umilasari, Reni; Susilowati, Liliek; Slamin, S; Prabhu, Savari
CAUCHY: Jurnal Matematika Murni dan Aplikasi Vol 7, No 4 (2023): CAUCHY: JURNAL MATEMATIKA MURNI DAN APLIKASI
Publisher : Mathematics Department, Universitas Islam Negeri Maulana Malik Ibrahim Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18860/ca.v7i4.18891

Abstract

Basically, the new topic of the dominant local metric dimension which be symbolized by Ddim_l (H) is a combination of two concepts in graph theory, they were called the local metric dimension and dominating set. There are some terms in this topic that is dominant local resolving set and dominant local basis. An ordered subset W_l is said a dominant local resolving set of G if W_l is dominating set and also local resolving set of G. While dominant local basis is a dominant local resolving set with minimum cardinality. This study uses literature study method by observing the local metric dimension and dominating number before detecting the dominant local metric dimension of the graphs. After obtaining some new results, the purpose of this research is how the dominant local metric dimension of vertex amalgamation product graphs. Some special graphs that be used are star, friendship, complete graph and complete bipartite graph. Based on all observation results, it can be said that the dominant local metric dimension for any vertex amalgamation product graph depends on the dominant local metric dimension of the copied graphs and how the terminal vertex is constructed
Penerapan Pembelajaran Kooperatif Teknik Kancing Gemerincing berbantuan Facebook Untuk Meningkatkan Aktivitas dan Hasil Belajar Siswa Sub Pokok Bahasan Persegi Panjang dan Persegi kelas VIIE SMP Negeri 2 Tanggul Tahun Ajaran 2013/2014 Nurjannah, Desy; Trapsilasiwi, Dinawati; Slamin, S
Jurnal Edukasi Vol. 1 No. 2: Juli 2014 : Jurnal Edukasi
Publisher : Universitas Jember, Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/jukasi.v1i2.1391

Abstract

Abstrak. Penelitian ini diselenggarakan dalam 2 siklus agar dapat menambah aktivitas dan hasil belajar siswa. Penelitian ini menggunakan model pembelajaran kooperatif teknik kancing gemerincing berbantuan facebook untuk memberikan kesempatan kepada siswa dalam memberikan kontribusi serta pandangan dan pemikiran dalam berkelompok. Penelitian yang digunakan adalah Class Action Research (CAR) dengan pendekatan yang berkualitas dan berkuantitas. Metode pengumpulan data yang digunakan adalah observasi, dokumentasi, tes dan wawancara.Hasil penelitian yang dapat menambah aktivitas siswa, hasil pembelajaran yang lengkap dan daya tarik siswa. Dapat disimpulkan bahwa adanya peningkatan kegiatan dan hasil belajar siswa. Kata Kunci : teknik kancing gemerincing, facebook, hasil pembelajaran.
SUPER (a,d)-EDGE-ANTIMAGIC TOTAL LABELING OF SILKWORM GRAPH Hadi, Dian Anita; 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.1828

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 SEGITIGA BERMUDA Anjelia, Novalita; Slamin, S; Dafik, D
Kadikma Vol 5 No 3 (2014): Desember 2014
Publisher : Department of Mathematics Education , University of Jember

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

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.
NILAI KETAKTERATURAN TOTAL SISI DARI GRAF TUNAS KELAPA A, Moch. Zaenal; Slamin, S; Setiawani, Susi
Kadikma Vol 5 No 3 (2014): Desember 2014
Publisher : Department of Mathematics Education , University of Jember

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

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 GUNUNG BERAPI Sholehah, Rukmana; Slamin, S; Dafik, D
Kadikma Vol 6 No 2 (2015): Agustus 2015
Publisher : Department of Mathematics Education , University of Jember

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

Abstract

Abstract. For a simple undirected connected graph G(V,E) with vertex set V and edge set E a labeling  : V  E → {1, 2, 3, ..., k} is called a total k-labeling. A total k-labeling is defined to be an edge irregular total k-labeling of the graph G if for every two different edges uv and xy of G there is t(uv) ≠ t(xy). The minimum k for which the graph G has an edge irregular total k-labeling is called the total edge irregularity strength of the graph G, denoted by tes(G). In this paper, we determine the total edge irregularity strength of volcano graph tes(Gbm,n) and the total edge irregularity strength of s copies volcano graph tes(sGbm,n). Key Words : edge irregular total labeling, total edge irregularity strength, volcano graph
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 (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.1276

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
SUPER (a,d)-EDGE ANTIMAGIC TOTAL LABELING OF CONNECTED LAMPION GRAPH Adawiyah, Robiatul; 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.1826

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.  
ANALISIS DIMENSI METRIK DENGAN HIMPUNAN PEMBEDA TERHUBUNG PADA GRAF KHUSUS KELUARGA POHON DIKAITKAN KETERAMPILAN BERPIKIR TINGKAT TINGGI Sulistio, Wahyu; Slamin, Slamin; dafik, dafik
Kadikma Vol 6 No 3 (2015): Desember 2015
Publisher : Department of Mathematics Education , University of Jember

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

Abstract

Abstract. Metrice dimension with connected resolving set is a minimal cardinality from resolving set on graph G that make metrice representation from every point v on graph G to the resolving set W different each other and every point of resolving set must be connected each other. For example G is a connected graph and W = {w1,w2,...,wk} are element of V. for every v∈V, position vectorr (v|W)=(d(v,w1),d(v,w2),...,d(v,wk)) are called metrice representation from v to W. Whenevery different point on V has different metrice representation, so W is called resolving set of G. Minimum cardinality from a resolving set of G for the next is call Metrice dimension of G that has been notation with dim(G). Resolving set of W is said connected if induction subgraph of <W> doesn't have a separated point. Minimum cardinality of connected resolving set from G is called connected resolving set of G that been notation with nr(G). In this research develop Metrice dimension with connected resolving set on special graph of tree specially on star graph, E graph, reguler catepillar graph, reguler banana tree grap hand reguler fireworkgraph. The result from this research is a theorem that indicated minimum cardinality of connected resolving set ornr(G) and how the link between metrice dimension with High Order Thinking Skill (HOTS). Keywords: Metrice Dimension, Connected resolving set, value of connected resolving set, HOTS
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