Abstract
A graph is regular if every vertex is of the same degree. Otherwise, it is an irregular graph. Although there is a vast literature devoted to regular graphs, only a few papers approach the irregular ones. We have found four distinct graph invariants used to measure the irregularity of a graph. All of them are determined through either the average or the variance of the vertex degrees. Among them there is the index of the graph, a spectral parameter, which is given as a function of the maximum eigenvalue of its adjacency matrix. In this paper, we survey these invariants with highlight to their respective properties, especially those relative to extremal graphs. Finally, we determine the maximum values of those measures and characterize their extremal graphs in some special classes.
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.
