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

Bilangan terhubung titik pelangi pada graf bunga (Wm,Kn) dan graf Oleander (Orn) Taha, Dennynatalis; Nurwan, Nurwan; Nasib, Salmun K.; Yahya, Nisky Imansyah
Unnes Journal of Mathematics Vol 10 No 1 (2021)
Publisher : Universitas Negeri Semarang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15294/ujm.v10i1.41247

Penelitian ini bertujuan untuk mencari bilangan terhubung titik pelangi. Misalkan G=(V(G),E(G)) adalah Graf Terhubung tak-trivial. Graf G dikatakan terhubung titik pelangi jika antara setiap dua titik pada suatu lintasan memiliki warna yang berbeda. Rainbow Vertex Connection pada graf G yang terhubung (Rvc(G) merupakan minimum warna yang dibutuhkan untuk membuat graf G terhubung titik pelangi. Pada penelitian ini membahas tentang bilangan terhubung titik pelangi (Rvc(G) pada Graf Bunga (Wm,Kn) dan Graf Oleander (Orn) . Berdasarkan hasil dari penelitian maka diperoleh rvc(Wm,Kn)=2 jika m=3 dan m=4 dan n>=3, rvc(Wm,Kn)=3 jika m=5. rvc(Orn)=diam-1 jika n=3,n=4 dan n=5, rvc(Orn)=diam-1 jika n=6

BILANGAN TERHUBUNG TITIK PELANGI PADA AMALGAMASI GRAF BERLIAN Afifah Farhanah Akadji; Dennynatalis Taha; Narti Lakisa; Nisky Imansyah Yahya
Euler : Jurnal Ilmiah Matematika, Sains dan Teknologi EULER: Volume 7 Issue 2 December 2019
Publisher : Universitas Negeri Gorontalo

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.34312/euler.v7i2.10345

Suppose there is a simple, and finite graph G = (V, E). The coloring of vertices c is denoted by c: E(G) → {1,2, ..., k} with k is the number of rainbow colors on graph G. A graph is said to be rainbow connected if every pair of points x and y has a rainbow path. A path is said to be a rainbow if there are not two edges that have the same color in one path. The rainbow connected number of graph G denoted by rc(G) is the smallest positive integer-k which makes graph G has rainbow coloring. Furthermore, a graph is said to be connected to rainbow vertex if at each pair of vertices x and y there are not two vertices that have the same color in one path. The rainbow vertex connected to the number of graph G is denoted by rvc(G) is the smallest positive integer-k which makes graph G has rainbow coloring. This paper discusses rainbow vertex-connected numbers in the amalgamation of a diamond graph. A diamond graph with 2n points is denoted by an amalgamation of a diamond graph by adding the multiplication of the graph t at point v is denoted by Amal (Brn,v,t).

Implementation of Dijkstra Algorithm and Welch-Powell Algorithm for Optimal Solution of Campus Bus Transportation Nurwan Nurwan; Widya Eka Pranata; Muhamad Rezky Friesta Payu; Nisky Imansyah Yahya
Jurnal Matematika MANTIK Vol. 7 No. 1 (2021): Mathematics and Applied Mathematics
Publisher : Mathematics Department, Faculty of Science and Technology, UIN Sunan Ampel Surabaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15642/mantik.2021.7.1.31-40

This research deals with applying the Dijkstra algorithm and Welch-Powell algorithm to on-campus bus transportation problems. This research aims to determine the optimal solution of campus bus transportation routes in the shortest routes and schedules. In determining the fastest way, each intersection represented as a node, and the path described as the sides. The shortest path obtained V1 - V2 - V5 - V8 - V9 - V10 - V13 - V16. In determining the optimal schedule, the number of buses represents the vertices, and the time expresses the side that connects each node. The optimal program of the bus starts from 06.30 am to 5.00 pm. Every bus gets four sessions of departure and four sessions return with travel time each session is 60 minutes.

Bilangan Terhubung Titik Pelangi pada Graf Hasil Operasi Korona Graf Prisma (P_(m,2)) dan Graf Lintasan (P_3) Indrawati Lihawa; Sumarno Ismail; Isran K Hasan; Lailany Yahya; Salmun K Nasib; Nisky Imansyah Yahya
Jambura Journal of Mathematics Vol 4, No 1: January 2022
Publisher : Department of Mathematics, Universitas Negeri Gorontalo

Rainbow vertex-connection number is the minimum k-coloring on the vertex graph G and is denoted by rvc(G). Besides, the rainbow-vertex connection number can be applied to some special graphs, such as prism graph and path graph. Graph operation is a method used to create a new graph by combining two graphs. Therefore, this research uses corona product operation to form rainbow-vertex connection number at the graph resulting from corona product operation of prism graph and path graph (Pm,2 P3) (P3 Pm,2). The results of this study obtain that the theorem of rainbow vertex-connection number at the graph resulting from corona product operation of prism graph and path graph (Pm,2 P3) (P3 Pm,2) for 3 = m = 7 are rvc (G) = 2m rvc (G) = 2.

SEBUAH GENERALISASI GRAF TAK BERARAH PADA HIMPUNAN BAGIAN TERBATAS DARI BILANGAN ASLI Asriadi Asriadi; BERTU RIANTO TAKAENDENGAN; NISKY IMANSYAH YAHYA
Jurnal Matematika UNAND Vol 11, No 1 (2022)
Publisher : Jurusan Matematika FMIPA Universitas Andalas Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25077/jmu.11.1.47-52.2022

Tulisan ini mengkaji tentang sebuah generalisasi graf tak berarah dengan fokus pada pada himpunan bagian terbatas dari bilangan asli. Generalisasi ini adalah sebuah pendekatan rigor untuk teori graf. Beberapa sifat fundamental dari generalisasi graf tak berarah akan menjadi fokus dalam tulisan ini.

Bilangan Terhubung Titik Pelangi Kuat Graf Octa-Chain (OCm) Nisky Imansyah Yahya; Karina Anselia Mamonto; Nurwan Nurwan; Lailany Yahya; Djihad Wungguli; La Ode Nashar
Euler : Jurnal Ilmiah Matematika, Sains dan Teknologi EULER: Volume 10 Issue 1 June 2022
Publisher : Universitas Negeri Gorontalo

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.34312/euler.v10i1.15177

An Octa-Chain graph (OCm) is a graph formed by modifying the cycle graph C8 by adding an edge connecting the midpoints in C8. The minimum number of colors used to color the vertices in a graph so that every two vertices have a rainbow path is called the rainbow vertex-connected number denoted by rvc (G). While the minimum number of colors used to color the vertices in a graph so that every two vertices are always connected by a rainbow path is called a strong rainbow vertex connected number and is denoted by srvc (G). This study aims to determine the rainbow vertex-connected number (rvc) and the strong rainbow-vertex-connected number (srvc) in the Octa-Chain graph (OCm). The results obtained from this research are the rainbow vertex-connected number rvc (OCm)=2m and the strong rainbow-vertex-connected number srvc (OCm)=2m.

BILANGAN TERHUBUNG PELANGI PADA GRAF SALJU (Sn_m) Cindy Aisa Putri Noor; Lailany Yahya; Salmun K Nasib; Nisky Imansyah Yahya
Journal of Fundamental Mathematics and Applications (JFMA) Vol 4, No 1 (2021)
Publisher : Diponegoro University

Suatu graf dikatakan terhubung pelangi jika terdapat lintasan antara dua titik yang setiap sisi-sisinya memiliki warna berbeda. Misalkan terdapat suatu graf G tak trivial dengan definisi warna c:E(G)->{1,2,3,...}, maka bilangan terhubung pelangi dari graf G yaitu minimum k dari pewarnaan-k pelangi yang digunakan untuk mewarnai graf G dan dinotasikan dengan rc(G). Tujuan dari penelitian ini yaitu untuk menentukan bilangan terhubung pelangi pada graf salju (Sn_m). Metode yang digunakan pada penelitian ini yaitu metode studi literatur dengan prosedur sebagai berikut; menggambar graf salju, mencari pola bilangan terhubung pelangi, dan membuktikan teorema bilangan terhubung pelangi pada graf salju (Sn_m). Sehingga diperoleh rc(Sn_m)=m+1 untuk 3<=m<=7 dan m={9,10} dan rc(Sn_m)=m untuk m=8 dan m>=11.

BILANGAN TERHUBUNG PELANGI PADA GRAF HASIL OPERASI KORONA GRAF ANTIPRISMA (APm) DAN GRAF LENGKAP (K4) Khairun Nisa Humolungo; Sumarno Ismail; Isran K. Hasan; Nisky Imansyah Yahya
Jurnal Matematika UNAND Vol 11, No 2 (2022)
Publisher : Jurusan Matematika FMIPA Universitas Andalas Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25077/jmua.11.2.112-123.2022

Bilangan terhubung pelangi didefinisikan sebagai banyaknya jumlah warna minimum yang dibutuhkan untuk membuat graf G menjadi terhubung pelangi, dengan syarat sisi yang termasuk dalam lintasan pelangi tidak boleh memiliki warna yang sama. Bilangan terhubung pelangi disimbolkan dengan rc(G). Seiring berkembangnya ilmu pengetahuan dan penelitian, maka bilangan terhubung pelangi mulai diterapkan ke dalam operasi graf. Penelitian ini menggunakan operasi korona untuk mengetahui bilangan terhubung pelangi dari graf antiprisma (APm) dan graf lengkap (K4). Berdasarkan hasil penelitian, maka diperoleh teorema bilangan terhubung pelangi dari graf (APm ⊙ K4) = 2m untuk 3 ≤ m ≤ 7 dan bilangan terhubung pelangi dari graf (K4 ⊙ APm) = 4 untuk m = {3, 4} ∧ 2m − 2 untuk 5 ≤ m ≤ 9, m ganjil ∧ 2m untuk 5 ≤ m ≤ 9, m genap.

Critical Path Method dan Algoritma Genetika untuk Optimasi Durasi dan Biaya Pembangunan Wahdania A.T. Ja’a; Muhammad Rifai Katili; Djihad Wungguli; Nisky Imansyah Yahya
Euler : Jurnal Ilmiah Matematika, Sains dan Teknologi EULER: Volume 10 Issue 2 December 2022
Publisher : Universitas Negeri Gorontalo

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.34312/euler.v10i2.14488

A large project requires proper scheduling to obtain the duration of development and costs incurred more optimally. Optimization is submitting the project duration efficient solution by using various alternatives that can be reviewed in terms of cost and time. Optimization problems can be solved using operating research. Selected Critical Path Method and Genetic Algorithm as a compelling method for planning and an methods rolling schedules the Critical Method because this method considers the assumption of time, then the implementation of the project is done without thinking about resources and can also determine when an activity starts and when the end of the project. While the Genetic Algorithm method is a method that can provide quick and efficient results in forming a project schedule. Based on the results of the study obtained that has managed to get the optimization value by minimizing the duration of the project using CPM (Critical Path Method) is 199 days from the total project time of the construction of the health center Biau 210 working days. and the costs incurred due to the optimization using genetic algorithms amounted to Rp. 231,515,082 from the initial cost of the project of Rp.382,784,000.

Implementasi Algoritma Hierarchical Clustering dan Non-Hierarchical Clustering untuk Pengelompokkan Pengguna Media Sosial Zulkifli Alamtaha; Ismail Djakaria; Nisky Imansyah Yahya
ESTIMASI: Journal of Statistics and Its Application Vol. 4, No. 1, Januari, 2023 : Estimasi
Publisher : Hasanuddin University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20956/ejsa.vi.24830

Social media is a means to interact with other people through sentences, pictures and videos online. Excessive use of social media has a negative impact on mental health. The grouping process in this study was carried out to see the level of social media use in Bone Bolango Regency. Before grouping, data pre-processing is carried out and the optimal number of clusters is determined using the Silhoutte index. The optimal cluster results obtained are two clusters for all methods. After that, grouping is done using Hierarchical Clustering and Non-Hierarchical Clustering Algorithms. The Hierarchical Clustering algorithm consists of two methods, namely the single linkage method and the complete linkage method. The Non-Hierarchical Clustering Algorithm consists of two methods, namely the K-Means and K-Medoids methods. The next step is to determine the best method using the Davies-Bouldin Index (DBI). The smaller the DBI value, the better the method used. The smallest DBI value is obtained in the complete linkage method. The grouping results for cluster 1 consisted of 70 respondents and cluster 2 consisted of 80 respondents.

Co-Authors Afifah Farhanah Akadji Afifah Farhanah Akadji Agusyarif Rezka Nuha Akadji, Afifah Farhanah 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 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 Sidik, Amelia T. R. 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