Abstract
The modified Sombor (mSO) index of a given graph [Formula: see text] is symbolized with mSO and define by sum of the weights [Formula: see text], where [Formula: see text] is the degree of a vertex [Formula: see text] in [Formula: see text]. In this work, we present the first and second maximum values of the mSO index among all [Formula: see text]-vertex [Formula: see text]-cyclic graphs. We also provide that the mSO index attains its maximum and second maximum on two classes of chemical graphs. Finally, we will present new lower and upper bounds for the mSO index of connected chemical graphs.
Sign-in/Register to access full text options 
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.
