The Locating Chromatic Number For Corona Operation Of Path And Cycle With Python Programming
Abstract
Locating chromatic number of a graph is a concept that is still interesting today because there is no theorem or algorithm that can determine the locating chromatic number of any graph. In this research, an algorithm was created to determine the locating chromatic number for corona operation of path and cycle with Python programming.
Full text article
References
G. Chartrand, D. Erwin, M. A. Henning, P. J. Slater, and P. Zhang, “The locating-chromatic number of a graph,” Bull. Inst. Combin. Appl., vol. 36, pp. 89–101, 2002.
G. Chartrand, Erwin, M. A. Henning, J. Slater, and P. Zhang, “Graph of order n with locating-chromatic number n-1,” Discrete Math, vol. 269, pp. 65–79, 2003.
Asmiati, “On the locating-chromatic number of non-homogeneous caterpillars and firecracker graphs,” Far East Journal of Mathematical Sciences, vol. 100, no. 8, pp. 1305–1316, 2016.
Asmiati, M. Damayanti, and L. Yulianti, “On the locating chromatic number of barbell shadow path graph,” Indonesian Journal of Combinatorics, vol. 5, no. 2, pp. 82–93, 2021. http://dx.doi.org/10.19184/ijc.2021.5.2.4.
Asmiati, A. Irawan, A. Nuryaman, and K. Muludi, “The locating chromatic number for certain operation of origami graphs,” Mathematics and Statistics, vol. 11, no. 1, pp. 101–106, 2023. https://doi.org/10.13189/ms.2023.110111.
A. Yulianti, Asmiati, N. Hamzah, and Notiragayu, “The locating chromatic number for amalgamation of some complete graphs,” InPrime: Indonesian Journal of Pure and Applied Mathematics, vol. 6, no. 1, pp. 76–88, 2024. https://doi.org/10.15408/inprime.v6i1.38711.
A. Irawan, Asmiati, L. Zakaria, and K. Muludi, “The locating-chromatic number of origami graphs,” Algorithms, vol. 14, no. 6, pp. 1–15, 2021. https://doi.org/10.3390/a14060167.
A. Irawan, Asmiati, B. H. S. Utami, A. Nuryaman, and K. Muludi, “A procedure for determining the locating chromatic number of an origami graphs,” IJCSNS, vol. 22, no. 9, pp. 31–34, 2022. http://paper.ijcsns.org/07_book/202209/20220905.pdf.
M. Damayanti, Asmiati, Fitriani, M. Ansori, and A. Faradilla, “The locating chromatic number of some modified path with cycle having locating number four,” in Journal of Physics: Conference Series, vol. 1751, IOP Publishing Ltd, 2021. https://doi.org/10.1088/1742-6596/1751/1/012008.
K. Prawinasti, M. Ansori, Asmiati, Notiragayu, and A. R. G. N. Rofi, “The locating chromatic number for split graph of cycle,” in Journal of Physics: Conference Series, vol. 1751, IOP Publishing Ltd, 2021. https://doi.org/10.1088/1742-6596/1751/1/012009.
F. Zikra, D. Welyyanti, and L. Yulianti, “The locating-chromatic number of disjoint union of fan graphs,” Jurnal Matematika UNAND, vol. 11, no. 3, 2022. https://doi.org/10.25077/jmua.11.3.159-170.2022.
B. M. Salindeho, H. Assiyatun, and E. T. Baskoro, “On the locating-chromatic number of subdivisions of friendship graph,” JIMS: Journal of the Indonesian Mathematical Society, vol. 26, no. 2, pp. 175–184, 2020. https://doi.org/10.22342/jims.26.2.822.175-184.
D. Welyyanti, R. Lestari, and S. R. Putri, “The locating-chromatic number of disconnected graph with path and cycle graph as its components,” in IOP Conference Series, vol. 1317, IOP Publishing Ltd, 2019. https://doi.org/10.1088/1742-6596/1317/1/012021.
S. Rahmatalia, Asmiati, and Notiragayu, “Bilangan kromatik lokasi graf split lintasan,” Jurnal Matematika Integratif, vol. 18, no. 1, 2022. https://doi.org/10.24198/jmi.v18.n1.36091.73-80.
R. Frucht and F. Harary, “On the corona of two graphs,” Aequationes mathematicae, vol. 4, no. 3, pp. 322–325, 1970. https://doi.org/10.1007/BF01844162.
N. Hamzah, Asmiati, and W. D. Amansyah, “Locating chromatic number for corona operation of path and cycle,” Indonesian Journal of Combinatorics, vol. 8, no. 2, pp. 127–135, 2024. http://dx.doi.org/10.19184/ijc.2024.8.2.6.
Authors
Copyright (c) 2025 Journal of the Indonesian Mathematical Society
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Article Details
