Pewarnaan Ketakteraturan Lokal Inklusif pada Keluarga Graf Pohon Tree
Umi Azizah Anwar, Arika Indah Kristiana, Arif Fatahillah, Dafik Dafik, Ridho Alfarisi · CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS · 2021
All graph in this paper is a simple and connected graph. We define $l: V(G) \to \{ 1, 2, 3,...k\} $ is called vertex irregular k-labeling and $w: (G) \to N$ the weight function with $[\sum_{u \epsilon N} l(u) + l(v) ]$. A local irregularity inclusive coloring if every $u, v \epsilon E(G), w(u) e w(v) $ and $max (l) = min \{ max (l_i), l_i label function\}$. The chromatic number of local irregularity inclusive coloring of $G$ denoted by $\chi_{lis}^{i}$, is the minimum cardinality of local irregularity inclusive coloring. We study about the local irregularity inclusive coloring of some family tree graph and we have found the exact value of their chromatic number.