Pewarnaan Titik Ketakteraturan Lokal Inklusif pada Keluarga Graf Tangga

Abstract

Graph theory is one of the branches of mathematics that is widely used to model various real-life problems. One of the important concepts in graph theory is graph coloring, which includes vertex coloring, edge coloring, and face coloring. One development of this concept is inclusive local irregular vertex coloring, which assigns labels to the vertices of a graph according to certain rules such that the inclusive local weights of every pair of adjacent vertices are different. The purpose of this coloring is to determine the minimum chromatic number of a graph. This research discusses Inclusive Local Irregular Vertex Coloring on families of ladder graphs, including slanted ladder graphs, diamond ladder graphs, circular ladder graphs, pendant triangular ladder graphs, and variant triangular ladder graphs. The type of research used is exploratory, employing deductive axiomatic methods and pattern recognition. The results of this study produce new theorems concerning the chromatic number of inclusive local irregular vertex coloring for each graph investigated.