Bilangan Kromatik Lokasi Graf Split Lintasan

Abstract

The locating chromatic number of a graph extends the partition dimension and vertex coloring of a graph. The minimum number of locating coloring of graph G is called the locating chromatic number of graph G . This paper will discuss the locating chromatic number of path split graph and barbell path split graph. The method used to obtain the locating chromatic number of the graph is to determine the upper and lower bound. The results obtained are that the path split graph’s locating chromatic number and the barbell are the same, namely 4.