Abstract
For a connected graph G, the reduced second Zagreb index is defined as R M 2 = R M 2 ( G ) = ∑ u v ∈ E ( G ) ( d G ( u ) − 1 ) ( d G ( v ) − 1 ) , where dG(u) and dG(v) denote the degrees of vertices u and v in graph G, respectively. We determine the extremal graphs among all connected graphs of order n and with n2−m edges with respect to RM2, and obtain the first ten largest RM2 for connected graphs of order n. Moreover, we characterize the sharp upper bound on RM2 for all connected bipartite graphs with given connectivity k. Finally, the extremal graphs with respect to RM2 are determined in all connected bipartite graphs with matching number q.
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.
