Article Per Year (5 Year)
p-Index From 2020 - 2025
0.408
P-Index
This Author published in this journals
All Journal Jambura Journal of Mathematics Jurnal Matematika UNAND
Nasution, Dinda Khairani
Unknown Affiliation
Computer Science & IT Mathematics

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
The Hamiltonian and Hypohamiltonian of Generalized Petersen Graph (GP_(n,9)) Susilawati, Susilawati; Nasfianti, Iis; Agustiarini, Efni; Nasution, Dinda Khairani
Jambura Journal of Mathematics Vol 7, No 1: February 2025
Publisher : Department of Mathematics, Universitas Negeri Gorontalo

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.37905/jjom.v7i1.30053

Abstract

The study of Hamiltonian and Hypohamiltonian properties in the generalized Petersen graph GP_{n,k} is interesting due to the unique structure and characteristics of these graphs. The method employed in this study involves searching for Hamiltonian cycles within the generalized Petersen graph GP_{n,9}. Not all of GP_{n,9} graphs are Hamiltonian. For certain values of n, if the graph does not contain a Hamiltonian cycle, then one vertex should be removed from the graph to become Hamiltonian or neither. This research specifically investigates the Hypohamiltonian property of GP_{n,9}. The results show that for n ≡ 3 (mod 19) and n ≡ 5 (mod 19), GP_{n,9} is Hamiltonian. Meanwhile, for n ≡ 0 (mod 19), GP_{n,9} is Hypohamiltonian. Furthermore, for n ≡ 1 (mod 19), n ≡ 2 (mod 19), and n ≡ 4 (mod 19), GP_{n,9} is neither Hamiltonian nor Hypohamiltonian.
HAMILTONIAN CYCLES IN WIJAYA KUSUMA FLOWER GRAPH Nurdin, Susilawati; Nasution, Dinda Khairani
Jurnal Matematika UNAND Vol. 14 No. 2 (2025)
Publisher : Departemen Matematika dan Sains Data FMIPA Universitas Andalas Padang

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

Abstract

In 1856, William Rowan Hamilton introduced the Icosian game. From this game, the concept of a Hamiltonian graph is defined. Hamiltonian graph is a graph that contains the Hamiltonian cycle, which is a cycle that passes through each vertex exactly once. We constructed a new class of graph which is inspired by the Wijaya Kusuma flower. In this article, we study the Hamiltonian properties of the Wijaya Kusuma flower graph. Based on the proof, it is concluded that the Wijaya Kusuma flower graph is a Hamiltonian graph.
Co-Authors Efni Agustiarini, Efni Nasfianti, Iis Susilawati, S.