Garuda - Garba Rujukan Digital

p-Index From 2021 - 2026

6.189

P-Index

This Author published in this journals

NISKY IMANSYAH YAHYA

Universitas Negeri Gorontalo

Author-ID : 1764220

Astronomy Biochemistry, Genetics & Molecular Biology Chemical Engineering, Chemistry & Bioengineering Chemistry Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Education Electrical & Electronics Engineering Energy Engineering Mathematics Mechanical Engineering Physics Social Sciences Transportation Other

Published : 48 Documents Claim Missing Document

Claim Missing Document

Articles

1 2 3 4 5

Pemanfaatan Pelabelan Harmonis Graf Ular S_n Dalam Kriptografi Polialfabetik Tahir, Fauzia D.; Katili, Muh Rifai; Yahya, Nisky Imansyah; Wungguli, Djihad; Asriadi; Nurwan; Armayani Arsal
Jurnal Derivat: Jurnal Matematika dan Pendidikan Matematika Vol. 12 No. 2 (2025): Jurnal Derivat (Agustus 2025)
Publisher : Pendidikan Matematika Universitas PGRI Yogyakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31316/j.derivat.v12i2.7815

This research discusses harmonious labeling on the snake graph and its application in polyalphabetic cryptography. A harmonious labeling is an injective function from the set of vertices to the set of integers modulo , defined as . This function induces an edge labeling function . For each edge connecting vertices and , the edge label is given by , producing distinct edge labels. This study presents the construction process of harmonious labeling on the snake graph , where and . The results show that the snake graph satisfies the conditions for being harmoniously labeled since each edge receives a unique label. The vertex set of is defined as and the edge set as The harmonious labeling on this graph is then applied in cryptography, particularly in forming a cipher table used as a key in the polyalphabetic encryption and decryption process. This approach enhances cryptographic security, as a single plaintext letter can be transformed into various ciphertext possibilities, thereby increasing encryption strength and complicating message decryption attempts by unauthorized parties. Keywords: harmonious labeling, snake graph, cryptography, polyalphabetic cipher

Penerapan Ensemble K-modes Pada Pengelompokkan Kelurahan di Kota Gorontalo Berdasarkan Kecanduan Game Online Remaja Taufik, Mohamad Alfiransyah; Achmad, Novianita; Abdussamad, Siti Nurmardia; Wungguli, Djihad; Yahya, Nisky Imansyah
Griya Journal of Mathematics Education and Application Vol. 5 No. 2 (2025): Juni 2025
Publisher : Pendidikan Matematika FKIP Universitas Mataram

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.29303/griya.v5i2.633

The swift advancement of digital technology has resulted in a heightened frequency of online game usage among teenagers, raising concerns about potential addiction. This study aims to cluster urban villages in Gorontalo City based on the characteristics of online game addiction in adolescents, to support the formulation of more effective preventive policies. The method used is ensemble clustering with K-modes algorithm approach, which is effective for mixed numeric and categorical data. Data were obtained through a survey of adolescents aged 10-24 years in all urban villages, including indicators of lack of attention from close people, self-control, lack of activities, stress or depression, social environment, parenting, length of time playing online games, frequency of playing online games and many favorite online games. The clustering results obtained 3 optimum clusters, where cluster 1 consists of 7 neighborhoods, cluster 2 consists of 17 neighborhoods and cluster 3 consists of 26 neighborhoods. Cluster 1 is a group of neighborhoods with a low risk and addiction level, cluster 2 with a moderate tendency, and cluster 3 with a high tendency.

Density based spatial clustering of application with noise using flower pollination algorithm for leptospirosis clustering Karim, Finansiya S. Abd.; Rahmi, Emli; Abdussamad, Siti Nurmardia; Hasan, Isran K.; Yahya, Nisky Imansyah
PYTHAGORAS : Jurnal Program Studi Pendidikan Matematika Vol 14, No 1 (2025): PYTHAGORAS: Jurnal Program Studi Pendidikan Matematika
Publisher : UNIVERSITAS RIAU KEPULAUAN, BATAM, INDONESIA

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33373/pyth.v14i1.7505

Leptospirosis is an important health problem in Indonesia, with most cases found in East Java and Central Java provinces. This study aims to identify the distribution pattern of leptospirosis in the two provinces using a clustering approach. The Density-Based Spatial Clustering of Applications with Noise (DBSCAN) method is used to cluster areas based on leptospirosis spread factors, but DBSCAN requires optimal parameter determination for accurate results. Therefore, this research implements Flower Pollination Algorithm (FPA) to optimize the epsilon (ϵ) and minimum points (MinPts) parameters in DBSCAN. This research uses secondary data obtained from data on the Number of Natural Disaster Events by Regency / City in East Java and Central Java Provinces in 2023 and data on Population Density by Regency / City in East Java and Central Java Provinces in 2023. The population in this study uses all observations, namely all people in the districts and cities in East Java and Central Java. The sampling technique is saturated sampling, that is, the entire population in the study is sampled. The clustering results using FPA-DBSCAN resulted in two main clusters, with 30 districts/municipalities detected as noise, 23 districts/municipalities belonging to cluster 0, and 20 districts/municipalities in cluster 1. The validation test using Silhouette Coefficient showed a value of 0.1892, indicating that the clustering is quite valid. The results of this clustering can serve as a strategic reference for local governments in optimizing disease surveillance and targeted health interventions.

Rainbow vertex connection number and strong rainbow vertex connection number on slinky graph (SlnC4)) Akadji, Afifah Farhanah; Katili, Muhammad Rifai; Nasib, Salmun K.; Yahya, Nisky Imansyah
Desimal: Jurnal Matematika Vol. 4 No. 2 (2021): Desimal: Jurnal Matematika
Publisher : Universitas Islam Negeri Raden Intan Lampung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24042/djm.v4i2.7276

A graph is said rainbow connected if no path has more than one vertices of the same color inside. The minimum number of colors required to make a graph to be rainbow vertex-connected is called rainbow vertex connection-number and denoted by rvc(G) . Meanwhile, the minimum number of colors required to make a graph to be strongly rainbow vertex-connected is called strong rainbow vertex connection-number and denoted by srvc(G). Suppose there is a simple, limited, and finite graph G. Thus, G=(V(G),E(G)) with the determination of k-coloring c:V(G)->{1,2,...,k} . The reaserch aims at determining rainbow vertex connection-number and strong rainbow vertex connection-number on slinky graphs (Sl_nC_4). Moreover, the research method applies a literature study with the following procedures; drawing slinky graphs (Sl_nC_4), looking for patterns of rainbow vertex connection-number, and strong rainbow vertex connection-number on slinky graphs (Sl_nC_4), then proving the theorems obtained from the previous pattern. It is obtained rvc(Sl_nC_4)=2n-1, srvc(Sl_2C_4)=4, and srvc(Sl_nC_4) = 3n-3 for n>= 3.

IMPELEMENTASI ALGORITMA WELCH-POWELL DALAM PENJADWALAN PIKET JAGA SEKRETARIAT ORGANISASI MAHASISWA PADA HIMPUNAN MAHASISWA JURUSAN MATEMATIKA UNIVERSITAS NEGERI GORONTALO Tahir, Fauzia D; Prasetyo, Deny Ardika; Yahya, Nisky Imansyah
Amalgamasi: Journal of Mathematics and Applications Vol. 4 No. 1 (2025): Amalgamasi: Journal of Mathematics and Applications
Publisher : Universitas Pasifik Morotai

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.55098/amalgamasi.v4.i1.pp30-39

Graph theory is used to represent discrete objects and the relationships between them. One of its applications is scheduling through graph coloring. Scheduling duty shifts for an organizational secretariat often becomes a complex problem due to the varying class schedules of members. This article aims to implement graph coloring to arrange the duty schedule for HIMATIKA UNG using the Welch-Powell algorithm. This algorithm works by assigning different colors to adjacent vertices (representing members from the same class), resulting in a graph coloring with the minimum number of colors. The implementation results show that the chromatic number obtained is 6, representing six duty groups that do not overlap. This approach produces an optimal schedule that aligns with the academic schedules of HIMATIKA UNG members. The advantage of this algorithm lies in its efficiency in solving the problem and preventing overlapping schedules among members from the same class. The coloring process begins with the vertex of the highest degree as the initial step

Identifying the Fetal Heart Rate and gender with Intuitionistic Fuzzy Total edge Magic Labelling Aruchamy, Pradeepa; Mahagaonkar, Pralahad; Ganesan, Gomathi; Dhandapani, Prasantha Bharathi; Yahya, Nisky Imansyah
Jambura Journal of Biomathematics (JJBM) Volume 6, Issue 2: June 2025
Publisher : Department of Mathematics, Universitas Negeri Gorontalo

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.37905/jjbm.v6i2.30951

The application of Intuitionistic fuzzy total edge magic labelling to a graphical image at the 20th week of gestation provides insights into facilitates gender prediction as well as assessment of fetal blood flow on a second-trimester Doppler ultrasound screen. Ultrasounds screen the fetal heart rate during the 20th week of gestation using Doppler ultrasound for blood flow. A fetal heart rate above 2.5 beats per second suggests a female baby, while a rate less than 2.5 beats per second indicates a male baby. We convert the fetal heart blood flow into a graphical image and label it using intuitionistic fuzzy total edge magic labelling.

RAINBOW VERTEX-CONNECTION NUMBER ON COMB PRODUCT OPERATION OF CYCLE GRAPH (C_4) AND COMPLETE BIPARTITE GRAPH (K_(3,N)) Yahya, Nisky Imansyah; Fatmawati, Ainun; Nurwan, Nurwan; Nasib, Salmun K
BAREKENG: Jurnal Ilmu Matematika dan Terapan Vol 17 No 2 (2023): BAREKENG: Journal of Mathematics and Its Applications
Publisher : PATTIMURA UNIVERSITY

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30598/barekengvol17iss2pp0673-0684

Rainbow vertex-connection number is the minimum colors assignment to the vertices of the graph, such that each vertex is connected by a path whose edges have distinct colors and is denoted by . The rainbow vertex connection number can be applied to graphs resulting from operations. One of the methods to create a new graph is to perform operations between two graphs. Thus, this research uses comb product operation to determine rainbow-vertex connection number resulting from comb product operation of cycle graph and complete bipartite graph & . The research finding obtains the theorem of rainbow vertex-connection number at the graph of for while the theorem of rainbow vertex-connection number at the graph of for for .

Prediksi Harga Emas Dunia Menggunakan Deep Learning GRU dengan Optimasi Nadam Harmain, Ismail Saputra R.; Nurwan, Nurwan; Hasan, Isran K.; Wungguli, Djihad; Yahya, Nisky Imansyah
Jurnal Riset Mahasiswa Matematika Vol 4, No 6 (2025): Jurnal Riset Mahasiswa Matematika
Publisher : Universitas Islam Negeri Maulana Malik Ibrahim Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18860/jrmm.v4i6.36007

Volatilitas harga emas yang tinggi menuntut adanya metode prediksi yang andal untuk mendukung pengambilan keputusan investasi. Penelitian ini mengimplementasikan algoritma Gated Recurrent Unit (GRU) berbasis deep learning yang dioptimalkan menggunakan Nesterov-Accelerated Adaptive Moment Estimation (Nadam) untuk memprediksi harga emas harian.Model terbaik diperoleh dengan nilai Mean Squared Error (MSE) sebesar 0, 00012 pada data univariat dan 0, 00027 pada data multivariat. Mean Absolute Percentage Error (MAPE) yang diperoleh masing-masing sebesar 1,107% untuk data univariat dan 1,59% untuk data multivariat. Hasil tersebut mengindikasikan bahwa model GRU dengan optimasi Nadam memiliki performa prediksi yang tinggi, baik pada data deret waktu tanpa penambahan fitur maupun dengan penambahan fitur.

KOMBINASI ALGORITMA KRIPTOGRAFI RC6 DAN STEGANOGRAFI LSB UNTUK PENGAMANAN PESAN TEKS Kai, Ferawati; Nuha, Agusyarif Rezka; Asriadi, Asriadi; Panigoro, Hasan S.; Yahya, Nisky Imansyah; Arsal, Armayani
MATHunesa: Jurnal Ilmiah Matematika Vol. 13 No. 2 (2025)
Publisher : Universitas Negeri Surabaya

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

The rapid advancement of technology has led to various types of technological crimes. One solution to secure messages is by using cryptographic and steganographic techniques. This research combined the Rivest Code 6 (RC6) cryptographic algorithm and the Least Significant Bit (LSB) steganographic algorithm to enhance message security. The study analyzed changes in an image embedded with a message and sent through applications such a WhatsApp, Telegram, and E-mail. The final result show that the image embedded with the message does not undergo significant changes. However, stego images sent directly via WhatsApp and Telegram experience size alterations, which cause the embedded messages to become corrupted. Meanwhile, stego images sent as documents retain their size, allowing the message to remain intact. Additionally, stego images sent via E-mail, either as attachments or directly, do not experience size changes, and the embedded messages can be fully retrieved.

Implementation of Graph Coloring on the Map of North Gorontalo District Using the D’Satur Algorithm and the Backtracking Algorithm Imran, Nurain; Achmad, Novianita; Asriadi, Asriadi; Yahya, Nisky Imansyah; Nasib, Salmun K.; Katili, Muh Rifai
Indonesian Journal of Mathematics and Applications Vol. 3 No. 2 (2025): Indonesian Journal of Mathematics and Applications (IJMA)
Publisher : Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21776/ub.ijma.2025.003.02.5

Graph Coloring is the process of assigning colors to vertices such that no adjacent vertices share the same color, using the minimal number of colors possible. This study aims to implement graph coloring to the map of North Gorontalo Regency, which consists of 11 sub-districts and 123 villages, utilizing the D’Satur and Backtracking algorithms. It also compares the algorithms in terms of the smallest chromatic number and identifies strategic points in North Gorontalo Regency, particularly in sub-districts, based on the number of adjacent vertices. The study employed a case study method to gather information, specifically the map of North Gorontalo Regency. The results demonstrate that graph coloring of the map utilizing the D’Satur algorithm produces a chromatic number of (χ = 3) for sub-districts and (χ = 5) for villages. Meanwhile, the Backtracking algorithm yields a chromatic number of (χ = 3) for districts and (χ = 4) for villages. Thus, for sub-district coloring, both algorithms yield the same chromatic number. However, the Backtracking algorithm performs better for village coloring, as it produces the smallest chromatic number. The identified strategic sub-district is Kwandang, which has the highest degree of 4.

Co-Authors Afifah Farhanah Akadji Afifah Farhanah Akadji Agusyarif Rezka Nuha Akadji, Afifah Farhanah Amelia T. R. Sidik Armayani Arsal Aruchamy, Pradeepa Asriadi Asriadi Asriadi Asriadi Ayyasy, Muhammad Yahya Bertu Rianto Takaendengan Cindy Aisa Putri Noor Dennynatalis Taha Dewi Rahmawaty Isa Dhandapani, Prasantha Bharathi Djihad Wungguli Fatmawati, Ainun Franky Alfrits Oroh Fuzi Sandra Talibo Ganesan, Gomathi Hamani, Mohamad Taufik Harmain, Ismail Saputra R. Harun, Trieke Nurfadilah Hasan S. Panigoro Husuna, Cabelita Imran, Nurain Indrawati Lihawa Ismail Djakaria Isran K Hasan Jusuf, Anryan K. Nasib, Salmun Kai, Ferawati Karim, Finansiya S. Abd. Karina Anselia Mamonto Kasim, Afrianto Pratama Khairun Nisa Humolungo Kiayi, Fuji Fauzia La Ode Nashar Lailany Yahya Lailany Yahya Lakisa, Narti Lakoro, Tiara Mahagaonkar, Pralahad Meilan Sigar Melisa Huntala Mita Sari Mohamad Rivaldi Moha Mokodompit, Marcela Muhammad Rezky F. Payu Muhammad Rifai Katili Nadiyyah, Ana Narti Lakisa Novianita Achmad Novria Fatmawati Lakutu Nurmardia Abdussamad, Siti Nursiya Bito Nurwan Nurwan Nurwan Nurwan, Nurwan Periyannan, Jayalakshmi Pomahiya, Saiful Pranata, Widya Eka Prasetyo, Deny Ardika Rahim, Delvira Masita Rahmi, Emli Randi Mooduto Rauf, Dewi Nur Angriani Resmawan Resmawan Salmun K. Nasib Salmun K. Nasib Saravanakumar, Anitha Sari, Septi Rahmita Sembiring, Rinawati Siti Nurmardia Abdussamad Sri Lestari Mahmud Suharmin, Wandayana Nur'Amanah Sumarno Ismail Taha, Dennynatalis Tahir, Fauzia D Tahir, Fauzia D. Taufik, Mohamad Alfiransyah Wahab, Nur Dhea Wahdania A.T. Ja’a Wewengkang, Hanz Franklyn Bachruddin Zulkifli Alamtaha

Title

Found 48 Documents
Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title Search

Found 48 Documents Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title

Found 48 Documents
Search