HAMILTONIAN CYCLES IN WIJAYA KUSUMA FLOWER GRAPH
DOI:
https://doi.org/10.25077/jmua.14.2.167-177.2025Keywords:
Hamiltonian cycle, wijaya kusuma flower graph, wheel graph.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.
References
Ascheuer, N., 1996, Hamiltonian path problems in the on-line optimization of flexible manufacturing systems, Dissertation at Zuse Institute Berlin, Berlin, unpublished.
Grebinski, V., Kucherov, G., 1998, Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping, Discrete Applied Mathematics, Vol. 88: 147-165.
O’Callaghan, J.F., 1974, Computing the perceptual boundaries of dot patterns, Computer Graphics and Image Processing, Vol. 3: 141-162.
Eppstein, D., 2007, The traveling salesman problem for cubic graphs, Journal of Graph Algorithms and Applications, Vol. 11: 61-81.
Hung, R. W., Yao, C.C., Chan, S.J., 2015, The Hamiltonian properties of su- pergrid graphs, Theoretical Computer Science, Vol. 602: 132-148.
Kamˇcev, N., 2014, Generalised Knight’s tours, Electronic Journal of Combina- torics, Vol. 21: 1-31.
Leite, J. B., Mantovani, J. R. S., 2015, Distribution system state estimation using the Hamiltonian cycle theory, IEEE Transactions on Smart Grid, Vol. 7: 366-375.
Williams,H.,2023,TheMathematicsofMazes,MathematicsTODAY,Vol.59: 212-214.
Chartrand, G., Lesniak, L., Zhang, P., 2011, Graphs & digraphs, 5th, Chapman & Hall, Boca Raton.
Danarto, I., 2012, Sifat Hamiltonian dan Hipohamiltonian pada Graf Petersen Diperumun (GRn,1&GPn,2), Dissertation at University Islam Negeri Maulana Malik Ibrahim, Malang, unpublished.
Adwita, P. N., Gemawati, S., 2024, Hamiltonian and Hypohamiltonian of gen- eralized petersen graph GPn,6, Journal of Mathematical Sciences and Optimiza- tion, Vol. 1: 72-86.
Itai, A., Papadimitriou, C.H., Szwarcfiter, J.L., 1982, Hamilton paths in grid graphs, SIAM Journal on Computing, Vol. 11: 676-686.
Reay, J.R., Zamfirescu, T.,2000, Hamiltonian cycles in T-graphs, Discrete and Computational Geometry, Vol. 24: 497-502.
Hung, R. W., 2016, Hamiltonian cycles in linear-convex supergrid graphs, Dis- crete Applied Mathematics, Vol. 211: 99-112.
Gordon, V. S., Orlovich, Y. L., Werner, F., 2008, Hamiltonian properties of triangular grid graphs, Discrete Mathematics, Vol. 308: 6166-6188.
Jackson, B., 1980, Hamilton cycles in regular 2-connected graphs, Journal of Combinatorial Theory, Vol. 29: 27-46.
Ku ̈hn, D., Osthus, D.,2012, A survey on Hamilton cycles in directed graphs, European Journal of Combinatorics, Vol. 33: 750-766.
Munir, R., 2009, Matematika diskrit, 3th Informatika Bandung, Bandung.
Makalew,R.A.M.,Montolalu,C.E.,Mananohas,M.L.,2020,LintasanHamil
tonian pada Graf 4-Connected, d’Cartesian, Vol. 9: 181-188.
Rahmawati, N., Rahajeng, B., 2014, Dekomposisi graf sikel, graf roda, graf gir dan graf persahabatan, MATHunesa: Jurnal Ilmiah Matematika, Vol. 3: 64-71.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Departemen Matematika dan Sains Data FMIPA UNAND
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
All articles published in Jurnal Matematika UNAND (JMUA) are open access and licensed under the Creative Commons Attribution-ShareAlike (CC BY-SA) license. This ensures that the content is freely available to all users and can be shared and adapted, provided appropriate credit is given and any adaptations are distributed under the same license.
Copyright Holder
The copyright of all articles published in Jurnal Matematika UNAND is held by the Departemen Matematika dan Sains Data, Fakultas Matematika dan Ilmu Pengetahuan Alam (FMIPA), Universitas Andalas (UNAND). This applies to all published versions, including the HTML and PDF formats of the articles.
Author Rights
While the Departemen Matematika dan Sains Data FMIPA UNAND holds the copyright for all published content, authors retain important rights under the Creative Commons Attribution-ShareAlike 4.0 International License (CC BY-SA). This license grants authors and users the following rights:
- Reuse: Authors can reuse and distribute their work for any lawful purpose, including sharing on personal websites, institutional repositories, or in subsequent publications.
- Attribution and Adaptation: Authors and others may remix, adapt, and build upon the published work for any purpose, even commercially, as long as proper credit is given to the original authors, and any derivative works are distributed under the same CC BY-SA license.
Creative Commons License (CC BY-SA)
Under the terms of the CC BY-SA license, users are free to:
- Share: Copy and redistribute the material in any medium or format.
- Adapt: Remix, transform, and build upon the material for any purpose, even commercially.
However, the following conditions apply:
- Attribution: Users must give appropriate credit to the original author(s) and Departemen Matematika dan Sains Data FMIPA UNAND, provide a link to the license, and indicate if changes were made. Attribution must not imply endorsement by the author or the journal.
- ShareAlike: If users remix, transform, or build upon the material, they must distribute their contributions under the same license as the original.
For more information about the CC BY-SA license, please visit the Creative Commons website.
Third-Party Content
If authors include third-party material (such as figures, tables, or images) that is not covered by a Creative Commons license, they must obtain the necessary permissions for reuse and provide proper attribution. Authors are required to ensure that any third-party content complies with open-access licensing requirements or includes permissions for redistribution under similar terms.
Copyright and Licensing Information Display
The copyright and licensing terms will be clearly displayed on each article's landing page, as well as within the full-text versions (HTML and PDF) of all published articles.
No "All Rights Reserved"
As an open-access journal, JMUA does not use "All Rights Reserved" policies. Instead, the CC BY-SA license ensures that the works remain accessible and reusable for a wide audience while still protecting both the authors' and the copyright holder's rights.
Â
