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 
Bilangan Dominasi Graf Hasil Operasi Korona Sisi Yayuk Wahyuni; Mohammad Imam Utoyo; Slamin Slamin
Limits: Journal of Mathematics and Its Applications Vol 16, No 2 (2019)
Publisher : Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (415.62 KB) | DOI: 10.12962/limits.v16i2.5940

Abstract

Diberikan dua graf G dan H. Misalkan graf G mempunyai n titik dan m sisi. Operasi korona sisi (edge corona) dari dua graf G dan H, didefinisikan sebagai graf yang diperoleh dari satu salinan graf G dan m salinan graf H dan menghubungkan dua titik dari sisi ke-i pada graf G ke setiap titik dari salinan ke-i  dari graf H. Penelitian ini bertujuan untuk menentukan bilangan dominasi dari graf hasil operasi korona sisi antara graf-graf  tertentu dengan sebarang graf dan menentukan karakter graf yang bilangan dominasi hasil korona sisinya bernilai sama dengan bilangan dominasi graf induknya. Selain itu, pada penelitian ini juga dikaji nilai bilangan dominasi jarak-2 graf hasil operasi korona sisi beserta karakter graf yang mempunyai bilangan dominasi jarak-2 sama antara graf hasil operasi korona sisinya dengan graf induknya
Local antimagic vertex coloring of unicyclic graphs Nuris Hisan Nazula; S Slamin; D Dafik
Indonesian Journal of Combinatorics Vol 2, No 1 (2018)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (206.369 KB) | DOI: 10.19184/ijc.2018.2.1.4

Abstract

The local antimagic labeling on a graph G with ∣V∣ vertices and ∣E∣ edges is defined to be an assignment f : E → {1, 2, ⋯, ∣E∣} so that the weights of any two adjacent vertices u and v are distinct, that is, w(u) ≠ w(v) where w(u) = Σe ∈ E(u)f(e) and E(u) is the set of edges incident to u. Therefore, any local antimagic labeling induces a proper vertex coloring of G where the vertex u is assigned the color w(u). The local antimagic chromatic number, denoted by χla(G), is the minimum number of colors taken over all colorings induced by local antimagic labelings of G. In this paper, we present the local antimagic chromatic number of unicyclic graphs that is the graphs containing exactly one cycle such as kite and cycle with two neighbour pendants.
Randomness of encryption keys generated by super H-antimagic total labeling Antonius Cahya Prihandoko; Yudha Alif Auliya; Diksy Media Firmansyah; S Slamin
Indonesian Journal of Combinatorics Vol 4, No 1 (2020)
Publisher : Indonesian Combinatorial Society (InaCombS)

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

Abstract

SuperH-antimagic total labeling (SHATL) can be utilized to generate encryption keys. The keys are then used to establish the improved block and stream ciphers. In these ciphers, different blocks were encrypted by the different keys, but all block keys were connected one another. These conditions make the developed cryptosystems more secure and require less keys storage capacity compared to the ordinary block and stream cipher. The randomness of the generated keys, however, still need to be tested. The test is necessary to ensure that there is no specific pattern that can be utilized by any intruder to guess the keys. This paper presents the randomness tests applied to all key sequences generated by both the improved block scheme and the stream based scheme.
Wireless Area Network Infrastructure Model on Gili Ketapang Island Using Open Shortest Path First Routing Protocol Diah Ayu Retnani Wulandari; Yudha Alif Auliya; Antonius Cahya Prihandoko; Slamin Slamin; Mohammad Zarkasi
Kinetik: Game Technology, Information System, Computer Network, Computing, Electronics, and Control Vol. 7, No. 1, February 2022
Publisher : Universitas Muhammadiyah Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22219/kinetik.v7i1.1373

Abstract

This study aims to model the network for the archipelago and tourism on Gili Ketapang. The network model implemented is a wireless WAN network infrastructure to meet the needs of a reliable tourist area. This model implements DHCP and OSPF as the routing protocol. The methodology used is to perform simulations using a packet tracer in designing the network through several scenarios with parameters for assessing delay and packet loss. At the time of implementation, it began with a cluster area with the parameters of the number of business units spread across each hamlet. This network design utilizes OSPF, DHCP, and wireless network infrastructure resulting in the most considerable delay of 0.021 and packet loss of less than 3% so that it is included in the excellent category. The implementation results using the OSPF routing protocol, several paths do not go through the shortest path because they have to go through the backbone area, but because OSPF is a link-state, the cost is meager than the shortest path.
Hybrid Profile Matching and Forest Fire Model Strategies in Serious Game Supply Chain Management Agribusiness Saiful Bukhori; Wiji Utami; Slamin Slamin
International Journal of Supply Chain Management Vol 5, No 3 (2016): International Journal of Supply Chain Management (IJSCM)
Publisher : International Journal of Supply Chain Management

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

Abstract

Supply Chain Management (SCM) is increasingly being recognized as the integration of key business processes across the supply chain. Any company that joined in SCM must consider the strategies of the firms competitors. This research was discuss strategy in SCM agribusiness using hybrid profile matching and forest fire model and modelled in the form of serious games. Each cigarette factories compete to get tobacco from farmers in accordance with the required quality, so farmers can compete to sell tobacco in accordance with its quality. The results of the simulations revealed that supply of tobacco from farmers to the cigarette factory is distributed in stage.
On r-Dynamic Coloring for Graph Operation of Cycle, Star, Complete, and Path Desy Tri Puspasari; Dafik Dafik; Slamin Slamin
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 1, No 1 (2020): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (2952.959 KB) | DOI: 10.25037/cgantjma.v1i1.2

Abstract

For integer k, r > 0, (k, r) -coloring of graph G is a proper coloring on the vertices of G by k-colors such that every vertex v of degree d(v) is adjacent to vertices with at least min{d(v), r} different color. By a proper k -coloring of graph G, we mean a map c : V (G) → S, where |S| = k, such that any two adjacent vertices are different color. An r -dynamic k -coloring is a proper k -coloring c of G such that |c(N (v))| ≥ min{r, d(v)} for each vertex v in V (G), where N (v) is the neighborhood of v and c(S) = {c(v) : v ∈ S} for a vertex subset S . The r-dynamic chromatic number, written as χr (G), is the minimum k such that G has an r-dynamic k-coloring. Note the 1-dynamic chromatic number of graph is equal to its chromatic number, denoted by χ(G), and the 2-dynamic chromatic number of graph denoted by χd (G). By simple observation with a greedy coloring algorithm, it is easy to see that χr (G) ≤ χr+1(G), however χr+1(G) − χr (G) does not always have the same difference. Thus finding an exact values of χr (G) is significantly useful. In this paper, we investigate the some exact value of χr (G) when G is for an operation product of cycle, star, complete, and path graphs.
Super (a; d)-H-Antimagic Total Covering of Triangular Cycle Ladder Graph for Developing Ciphertext Irma Azizah; Dafik Dafik; Slamin Slamin
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 1, No 1 (2020): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (2818.788 KB) | DOI: 10.25037/cgantjma.v1i1.8

Abstract

A (a; d)-H-antimagic total covering is a total labeling dari V (G) [ E(G) to integer number f1; 2; 3; :::; jV (G) [ E(G)jg with condition, every subgraph A inP P PG isomorphic with subgraph H A = v2V (A) (v) + e2E(A) (e) on arith-metic sequence. A graph containing the labeling called super (a; d)-H-antimagic total covering. Furthermore , f (v)gv2V = f1; :::; jV jg, is called graph super H antimagic. In this research used triangular Cycle Ladder Graph T CLn of con-nective to developing ciphertext. Key Word : Super H antimagic total selimut, Triangular Cycle Ladder Graph T CLn, Ciphertexts.
The Development of Research-Based Learning Tools with a STEM Approach to Improve Metaliteracy Skills to Solve Rainbow Vertex Anti-magic Coloring Problems Qurrotul A’yun; Slamin Slamin; Dafik Dafik
Pancaran Pendidikan Vol 11, No 2 (2022)
Publisher : The Faculty of Teacher Training and Education The University of Jember Jember, Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (567.517 KB) | DOI: 10.25037/pancaran.v11i2.391

Abstract

Metaliteracy is the framing and strengthening of information literacy based on critical and creative thinking. Metaliteracy indicators include generating, combining, using, participating, sharing, and collaborating. To implement higher-order thinking skills, we implement research-based learning with a STEM approach. To develop the students’ metaliteracy, educators should also equip the learning process by learning materials. In this study, we developed RBL-STEM learning materials to improve students' metaliteracy skills. The learning materials that have been developed are considered to be valid, effective, and practical. The validity score obtained in each materials is 3.5 for the Lesson Plan, 3.54 for the Student Worksheet, and 3.63 for the Learning Outcomes Test.
PEWARNAAN SISI r-DINAMIS PADA GRAF HASIL OPERASI AMALGAMASI TITIK KELUARGA GRAF POHON DAN KAITANNYA DENGAN KETERAMPILAN BERPIKIR TINGKAT TINGGI Lusia Dewi Minarti; Dafik Dafik; Susi Setiawani; Slamin Slamin; Arif Fatahillah
saintifika Vol 21 No 2 (2019)
Publisher : FKIP Universitas Jember

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

Abstract

Pewarnaan sisi dinamis suatu graf didefinisikan sebagai pemetaan dari ke himpunan warna sedemikian hingga memenuhi kondisi dan dimana adalah himpunan sisi yang bertetangga dengan dan adalah derajat titik . Nilai yang minimal sehingga graf memenuhi pewarnaan warna sisi dinamis disebut bilangan kromatik sisi dinamis, yang dinotasikan dengan Penelitian ini, peneliti menentukan bilangan kromatik pada graf hasil operasi amalgamasi titik dari keluarga graf pohon yaitu graf bintang dan graf sapu menggunakan metode deduktif aksiomatik. Hasil dari penelitian ini adalah teorema yang menyatakan bilangan kromatik pewarnaan sisi dinamis. Terdapat tiga teorema yang dihasilkan dari graf yang diteliti serta setiap tahap dalam penelitian ini dikaitkan dengan keterampilan berpikir tingkat tinggi.
PEWARNAAN TITIK TOTAL ANTIAJAIB LOKAL PADA GRAF HASIL OPERASI KORONA DAN KAITANNYA DENGAN KETERAMPILAN BERPIKIR TINGKAT TINGGI Safira Izza Ghafrina; Slamin Slamin; Dafik Dafik; Arif Fatahillah; Antonius Cahya Prihandoko
saintifika Vol 20 No 2 (2018)
Publisher : FKIP Universitas Jember

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

Abstract

Penelitian ini merupakan pengembangan dari paper berjudul “Local Antimagic Vertex Coloring of a Graph” oleh Arumugam et al. mengenai pewarnaan titik dengan pelabelan sisi pada graf khusus yang bertujuan untuk menentukan pewarnaan titik total antiajaib lokal pada graf hasil operasi korona. Penelitian juga akan menganalisis tentang keterkaitan antara pewarnaan titik total antiajaib lokal dengan pewarnaan titik antiajaib lokal pada graf hasil operasi korona ; Dan Menganalisis kaitan keterampilan berpikir tingkat tinggi dalam menentukan pewarnaan titik total antiajaib lokal pada graf hasil operasi korona yang diteliti menggunakan Taksonomi Bloom Revisi. Dalam penelitian ini digunakan instrumen validasi untuk mengetahui pencapaian tingkat keterampilan berpikir tinggi. Hasilnya, ditemukan teorema baru yang membuktikan bahwa bilangan kromatik antiajaib lokal oleh Arumugam lebih besar dibandingkan bilangan kromatik total antiajaib lokal . Dalam penelitian ini juga menghasilkan kaitan keterampilan berpikir tingkat tinggi dalam menentukan pewarnaan titik total antiajaib lokal pada graf hasil operasi korona yang diteliti.
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