Abstract
This paper presents some measures of graph irregularity found in the literature. From their discussion two important points appear: first, the absence of relationship between all of them, but a single exception, with the structures of the corresponding graphs and, moreover, their known extremal values correspond to graphs having degree sequences with few different values. Two new measures are proposed, seeking to meet these points. Their values are calculated for extremal graphs associated with other measures and for antiregular graphs. Finally, we calculate the boxplots of all these measures for some sets of graphs taken from the literature and also for four sets where the ordered degree sequences are constant. All measures involved have polynomial complexity.
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.
