Abstract
Let is a simple and connected graph with as vertex set and as edge set. Vertex labeling on inclusive local irregularity vertex coloring is defined by mapping and the function of the inclusive local irregularity vertex coloring is with . In other words, an inclusive local irregularity vertex coloring is defined by coloring the graph so that its weight value is obtained by adding up the labels of the neighboring vertex and its label. The inclusive local irregularity chromatic number is defined as the minimum number of colors obtained from coloring the vertex of the inclusive local irregularity in graph G, denoted by . In this paper, we learn about the inclusive local irregularity vertex coloring and determine the chromatic number on the book graphs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
