Abstract
For a graph G, Albertson [M. O. Albertson, The irregularity of a graph, Ars Comb., 46 (1997), 219-225] has defined the irregularity of G asirr(G)=∑xy∈E(G)|dG(x)−dG(y)| where dG(u) is the degree of vertex u. Recently, this graph invariant gained interest in chemical graph theory. In this work, we present some new results on the second minimum of the irregularity of graphs.
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.
