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

 1   2   3   4   5 
METODE BEDA HINGGA DAN TEOREMA NEWTON UNTUK MENENTUKAN JUMLAH DERET Mulyani, Tri; Hasan, Moh.; Slamin, Slamin
Prosiding Seminar Matematika dan Pendidikan Matematik Vol 1, No 1 (2014): Prosiding Seminar Nasional Matematika 2014
Publisher : Prosiding Seminar Matematika dan Pendidikan Matematik

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Permasalahan yang sering dihadapi untuk membuktikan kebenaran rumus suatu deret adalah jika yang disajikan rumus suatu deret yang bukan deret aritmatika dan bukan deret geometri. Salah satu pembuktian yang paling sering dipakai adalah pembuktian dengan induksi matematika. Penelitian ini dilakukan untuk menentukan rumus jumlah n suku pertama dari: (1) deret aritmatika, deret arirmatika bertingkat dengan landasan deret aritmatika; (2) deret geometri; (3) deret aritmatika bertingkat dengan landasan deret geometri; dan (4) deret yang bukan deret aritmatika dan bukan deret geometri yang diketahui rumus suku ke-nnya, dengan menggunakan metode beda hingga dan teorema Newton. Rumus jumlah n suku pertama yang diperoleh dari hasil penelitian kemudian dibuktikan kebenarannya dengan menggunakan induksi matematika.
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.  
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.  
NILAI KETAKTERATURAN TOTAL SISI DARI GRAF GUNUNG BERAPI Sholehah, Rukmana; Slamin, S; Dafik, D
KadikmA Vol 6, No 2 (2015)
Publisher : KadikmA

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

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
Nilai Ketakteraturan Jarak dari Graf Friendship dan Graf Matahari Windartini, Tanti; Slamin, Slamin; Dafik, Dafik
Prosiding Seminar Matematika dan Pendidikan Matematik Vol 1 No 5 (2014): Prosiding Seminar Nasional Matematika 2014
Publisher : Prosiding Seminar Matematika dan Pendidikan Matematik

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

$G$ adalah suatu graf dengan himpunan vertex $V(G)$ dan himpunan edge $E(G)$. Jarak $(distance)$ dari vertex $u$ ke $v$ di $G$, didefinisikan sebagai panjang lintasan terpendek dari $u$ ke $v$. Pelabelan jarak titik tak teratur pada graf $G$ dengan simpul $v$ dimana $V\rightarrow \{1,2,\ldots , k\}$ sehingga bobot yang dihitung pada simpul selalu berbeda. Ketakteraturan jarak $G$ dinotasikan sebagai $dis$ $(G)$, adalah nilai minimum dari label terbesar $k$ dari semua ketakteraturan. Bobot dari titik $x$ di $G$ didefinisikan sebagai jarak dari label semua simpul yang berdekatan dengan $x$ (jarak 1 dari $x$), yaitu $$wt(x)=\sum _{y\epsilon N (x)} \lambda (y)$$ Graf friendship dinotasikan dengan $f_n$, yang didefinisikan sebagai graf yang diperoleh dengan menggabungkan graf $C_3$ dimana $C_3\geq 3$ dengan satu simpul bersama. Nilai $distance$ dari graf friendship adalah $dis(f_n)=2n$. Graf matahari dinotasikan dengan $S_n$ adalah sebuah graf yang dibentuk dari graf siklus dengan $n$ titik pada siklus $C_n$ yang pada setiap titiknya terdapat bandul, sedemikian hingga jika $u_j$ adalah sisi ke-$j$ dari $C_n$ dan $v_j$ adalah titik pada bandul ke-$j$, maka $u_jv_j$ adalah titik ke-$j$ untuk setiap $j=1,2,...,n$. Nilai $distance$ dari graf matahari adalah $dis(S_n)=n$.
Pewarnaan Titik pada Graf Khusus: Operasi dan Aplikasinya Puspasari, Desy Tri; Dafik, Dafik; Slamin, Slamin
Prosiding Seminar Matematika dan Pendidikan Matematik Vol 1 No 5 (2014): Prosiding Seminar Nasional Matematika 2014
Publisher : Prosiding Seminar Matematika dan Pendidikan Matematik

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Misal diketahui graf sederhana $G=(V,E)$, dimana $V$ adalah himpunan titik dan $E$ adalah himpunan sisi. Aplikasi menarik dari suatu graf, salah satunya adalah pewarnaan graf ({\it graph colouring}). Terdapat tiga macam perwarnaan yaitu pewarnaan titik, sisi, dan wilayah. Dalam makalah ini akan dikaji pewarnaan titik. Pewarnaan titik adalah memberi warna pada titik-titiknya dari suatu graf sedemikian sehingga tidak ada dua titik yang bertetangga mempunyai warna yang sama. Jumlah warna minimum yang dapat digunakan untuk mewarnai graf dinyatakan dengan bilangan kromatik. Fokus utama makalah ini adalah menentukan bilangan kromatik pada graf operasi dan skema aplikasi dari pewarnaan graf titik.
Super (a,d)-edge-antimagic total labeling of connected Disc Brake graph Arianti, Inge Yosanda; Dafik, Dafik; Slamin, Slamin
Prosiding Seminar Matematika dan Pendidikan Matematik Vol 1 No 5 (2014): Prosiding Seminar Nasional Matematika 2014
Publisher : Prosiding Seminar Matematika dan Pendidikan Matematik

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Super edge-antimagic total labeling of a graph $G=(V,E)$ with order $p$ and size $q$, is a vertex labeling $\{1,2,3,...p\}$ and an edge labeling $\{p+1,p+2,...p+q\}$ such that the edge-weights, $w(uv)=f(u)+f(v)+f(uv), uv \in E(G)$ form an arithmetic sequence and for $a>0$ and $d\geq 0$, where $f(u)$ is a label of vertex $u$, $f(v)$ is a label of vertex $v$ and $f(uv)$ is a label of edge $uv$. In this paper we discuss about super edge-antimagic total labelings properties of connective Disc Brake graph, denoted by $Db_{n,p}$. The result shows that a connected Disc Brake graph admit a super $(a,d)$-edge antimagic total labeling for $d={0,1,2}$, $n\geq 3$, n is odd and $p\geq 2$. It can be concluded that the result has covered all the feasible $d$.
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