On the chromatic number local irregularity of related wheel graph

Abstract

A function f is called a local irregularity vertex coloring if (i) as vertex irregular k-labeling and , for every where and (ii) max(l) = min{max{li};livertex irregular labeling}. The chromatic number of local irregularity vertex coloring of G, 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 related wheel graphs and we have found the exact value of their chromatic number local irregularity, namely web graph, helm graph, close helm graph, gear graph, fan graph, sun let graph, and double wheel graph.