Local Irregularity Vertex Coloring of Graphs

Abstract

In this paper we study a new notion of coloring type of graph, namely a local irregularity vertex coloring. We define is called vertex irregular -labeling and where . By a local irregularity vertex coloring, we define a condition for if for every and vertex irregular labeling . The chromatic number of local irregularity vertex coloring of , denoted by , is the minimum cardinality of the largest label over all such local irregularity vertex coloring. In this article, we study the local irregularity vertex coloring of some graphs and we have found the exact value of their chromatic number