Abstract
A graph is an ordered pair of two sets V and E, written . is the set of vertices and is the set of edges of the graph . The labeling of the graph is defined by where is the labeling of the vertices. The function is the vertex coloring of the inclusive local irregularity if . The minimum color of the inclusive local irregularity vertex coloring is called the inclusive local irregularity chromatic number. This article will discuss the coloring of inclusive local irregularities on the graph resulting from the vertex shackle operation.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.