A COMPUTATIONAL APPROACH TO DETERMINING THE LOCATING-CHROMATIC NUMBER OF PIZZA GRAPHS

Authors

DOI:

https://doi.org/10.25077/jmua.15.4.601-610.2026

Keywords:

locating-chromatic number, pizza graph, Python programming, computational approach

Abstract

This study investigates the locating-chromatic number (L-cn) of the pizza graph Pzs using a computational approach implemented in Python. For s = 3, 4, 5, 6, 7, and 8, the program constructs the corresponding pizza graphs and determines their locating colorings. The computational results show that the locating-chromatic number of all tested pizza graphs is 4. These findings confirm previously reported results for s = 3 and s = 4, while different values are obtained for s = 5, 6, 7, and 8. In addition, the execution time increases significantly as the graph order grows. The results provide computational evidence for the locating-chromatic properties of pizza graphs and motivate further theoretical investigation.

Downloads

Download data is not yet available.

Author Biographies

Agus Irawan, Institut Teknologi Sumatera

Actuarial Science Study Program, Faculty of Sciences, Institut Teknologi Sumatera

Asmiati Asmiati, Universitas Lampung

Departemen Mathematics

References

[1] Svarcmajer, M., Ivanovic, D., Rudec, T., and Lukic, I., 2025, Application of graph theory and variants of greedy graph coloring algorithms for optimization of distributed peer-to-peer blockchain networks, Technologies, 13(1): 1–16.

[2] Thakare, S. B., and Bhapkar, H. R., 2024, Graph coloring, types and applications: A survey, Int. J. Math. Combin., 1: 110–139.

[3] Chartrand, G., Erwin, D., Henning, M. A., Slater, P. J., and Zhang, P., 2002, The locating chromatic number of a graph, Bull. Inst. Comb. Appl., 36: 89–101.

[4] Chartrand, G., Salehi, E., and Zhang, P., 2000, The partition dimension of a graph, Aequationes Math, 59: 45–54.

[5] Welyyanti, D., Azhari, M., and Lestari, R., 2021, On locating chromatic number of disconnected graph, J. Phys.: Conf. Ser., 1940: 1–4.

[6] Irawan, A., Asmiati, Zakaria, L., and Muludi, K., 2021, The locating-chromatic number of origami graph, Algorithms, 14(6): 1–15.

[7] Asmiati, Irawan, A., Nuryaman, A., and Muludi, K., 2023, The locating chromatic number for certain operation of origami graph, Math. Stat., 11(1): 101-106.

[8] Irawan, A., Asmiati, Zakaria, L., Muludi, K., and Utami, B. H. S., 2021, Subdivision of certain barbell operation of origami graphs has locating-chromatic number five, IJCSNS Int. J. Comput. Sci. Netw. Secur., 21(9): 79–85.

[9] Irawan, A., Asmiati, Suharsono, S., and Muludi, K., 2021, The locating chromatic number of certain barbell origami graphs, J. Phys.: Conf. Ser., 1751: 1– 13.

[10] Hamzah, N., Asmiati, and Amansyah, W. D., 2023, Locating chromatic number for corona operation of path Pn and cycle Cm (m = 3,4), Indonesian Journal of Combinatorics, 8(2): 127–135.

[11] Sawitri, R., Amelia, R., Asmiati, and Nurvazly, D. E., 2025, Locating chromatic number for rose graphs and barbell operation, Eigen Mathematics Journal, 8(1): 111–122.

[12] Welyyanti, D., Zahra, R. S., Yulianti, L., and Yanita, 2026, On the locating chromatic number of the sunflower graph, J. Indones. Math. Soc., 32(1): 1–12.

[13] Welyyanti, D., Abel, L. A., and Yulianti, L., 2025, The locating chromatic number of (A,4,n) graph, BAREKENG: Journal of Mathematics and Its Applications, 19(1): 353–360.

[14] Irawan, A., Asmiati, Utami, B. H. S., Nuryaman, A., and Muludi, K., 2022, A procedure for determining the locating chromatic number of an origami graph, IJCSNS Int. J. Comput. Sci. Netw. Secur., 22(9): 31–34.

[15] Nabila, S., and Salman, A. N. M., 2015, The rainbow connection number of origami graphs and pizza graphs, Procedia Comput. Sci., 74: 162–167.

[16] Surbakti, N. M., Kartika, D., Nasution, H., and Dewi, S., 2023, The locating chromatic number for pizza graphs, Sainmatika J. Ilm. Mat. dan Ilmu Pengetah. Alam, 20(2): 126–131.

[17] Irawan, A., and Asmiati, 2025, The locating-chromatic number for certain barbell operation on pizza graph and its subdivision, J. Math. UNAND, 14(3): 293–303

Downloads

Published

22-10-2026

How to Cite

Irawan, A., & Asmiati, A. (2026). A COMPUTATIONAL APPROACH TO DETERMINING THE LOCATING-CHROMATIC NUMBER OF PIZZA GRAPHS. Jurnal Matematika UNAND, 15(4), 601–610. https://doi.org/10.25077/jmua.15.4.601-610.2026

Issue

Vol. 15 No. 4 (2026)

Section

Articles

License

Copyright (c) 2026 Departemen Matematika dan Sains Data FMIPA UNAND

Creative Commons License

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 4.0 International License (CC BY-SA 4.0). This license allows published content to be freely accessed, shared, redistributed, and adapted for any purpose, including commercial use, provided that the applicable license conditions are followed.

Copyright Holder

The copyright of 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), in accordance with the journal's stated copyright policy.

Author Rights

Under the CC BY-SA 4.0 license, authors may share, distribute, and reuse their published articles, subject to the applicable license conditions. These rights include:

  • Self-Archiving: Authors may deposit their published articles in institutional repositories, personal websites, or academic platforms.

  • Reuse: Authors may reuse their published work in subsequent publications, research, teaching materials, or other lawful purposes, provided that appropriate attribution is maintained.

  • Distribution: Authors may share and distribute their published articles without requiring additional permission under the terms of the license.

Creative Commons License (CC BY-SA 4.0)

Under the CC BY-SA 4.0 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, including commercial purposes.

These permissions are subject to the following conditions:

  • Attribution: Users must give appropriate credit to the original author(s), retain relevant copyright notices, provide a link to the license, and indicate if changes were made. Attribution must not imply endorsement by the author(s), copyright holder, or journal.

  • ShareAlike: If users remix, transform, or build upon the material, they must distribute their contributions under the same CC BY-SA 4.0 license or a compatible license.

  • No Additional Restrictions: Users may not apply legal terms or technological measures that legally restrict others from exercising the rights granted by the license.

For more information about the CC BY-SA 4.0 license, please visit:

https://creativecommons.org/licenses/by-sa/4.0/

Third-Party Content

Third-party materials, including figures, tables, photographs, and illustrations, are covered by the article's CC BY-SA 4.0 license only when their inclusion under that license is authorized.

Materials excluded from the license must be clearly identified with appropriate copyright notices and attribution. Authors are responsible for obtaining any necessary permissions, while users must comply with the applicable licensing terms or permissions when reusing excluded materials.

Copyright and Licensing Information

Copyright and licensing information should be clearly displayed on each published article's landing page and included in the full-text versions (HTML and PDF), where applicable, to ensure transparency regarding copyright ownership and permitted reuse.