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.
Copyrights © 2026