Pewarnaan Titik Ketakteraturan Lokal Inklusif pada Keluarga Graf Unicyclic

The graph in this paper is a simple and connected graph with V(G) is vertex set and  E(G) is edge set. An inklusif local irregularity vertex coloring is defined should be maping l:V(G) í  {1,2,..., k} as vertex labeling and wⁱ : V(G) í  N is function of inclusive local irregularity vertex coloring, with wⁱ(v) = l(v) + ∑_u∈N(v) l(u) in other words, an inclusive local irregularity vertex coloring is to assign a color to the graph with the resulting weight value by adding up the labels of the vertices that are should be neighboring to its own label. The minimum number of colors produced from inclusive local irregularity vertex coloring of graph G is called inclusive chromatic number local irregularity, denoted by X_lisⁱ(G). Should be in this paper, we learn about the inclusive local irregularity vertex coloring and determine the chromatic number on unicyclic graphs.