Answers are grounded in this paper and cite their sources.
Let is a simple graph and connected where is vertex set and is edge set. A maping as vertex k- labeling and function : is inclusive local irregularity vertex coloring, with . The minimum number of colors produced from inclusive local irregularity vertex coloring of graph is called inclusive chromatic number local irregularity, denoted by . On this paper, we learn about the inclusive local irregularity vertex coloring and determine the chromatic number on grid graph family.
No takes yet. Share an insight, caveat, or question.
Kristiana et al. (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: