Abstract
The imbalance of an edge in a graph is defined as the absolute value of the difference of the degrees of its end-vertices. The irregularity of a simple graph G is defined as the sum of the imbalances of all edges of G . It is used as a measure to quantify the deviation of a graph from being regular. In this paper, a sharp lower bound on the irregularity of trees and unicyclic graphs in terms of the maximum degree is established and the corresponding extremal trees and unicyclic graphs are characterized.
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.
