Abstract
The location chromatic number for a graph is an extension of the concepts of partition dimension and vertex coloring in a graph. The minimum number of colors required to perform location coloring in graph G is referred to as the location chromatic number of graph G. This research is a literature study that discusses the location chromatic number of the Pizza graph. The approach used to calculate the location-chromatic number of these graphs involves determining upper and lower bounds. The results obtained show that the location chromatic number of the pizza graph is 4 for n = 3 and n for ≥ 4.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Sainmatika: Jurnal Ilmiah Matematika dan Ilmu Pengetahuan Alam
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
