The locating chromatic number remains an active topic in graph theory. It combines the concepts of partition dimension and proper vertex coloring. A necessary condition for determining the locating chromatic number is that each vertex must have a unique color code under a minimal coloring. This paper investigates the locating chromatic number of theĀ (k,n)-split cycle graph and its barbell operation.
Copyrights © 2025