Pewarnaan Titik Ketakteraturan Lokal pada Keluarga Graf Unicyclic

In this research is a development of local irregularity vertex coloring of graph. The based on definition, as follows: \textbf{$l:V(G) \longrightarrow {\{1, 2, ..., k}\}$} is called vertex irregular k-labelling and \textbf{$w:V(G) \longrightarrow N$} where \textbf{$w(u) = \varSigma_{ v \in N(u)}l(v)$}, $w$ is called local irregularity vertex coloring. A condition for $w$ to be a local irregularity vertex coloring, If \textit{opt$(l)$ = min\{maks$(li); li$, vertex labelling function}, and for every \textbf{$u,v\in E(G),w(u)\ne w(v)$}. The chromatic number local irregularity vertex coloring is denoted by $\chi_{lis}(G)$. In this paper, the researchers will discuss of local irregularity vertex coloring of related unicyclic graphs and we have found the exact value of their chromatic number local irregularity, namely cricket graph, net graph, tadpole graph, \textit{peach} graph, and bull graph.