Abstract
We investigate how the inverse degree index of graphs depends on their cyclomatic number. In particular, we provide sharp lower bounds on the inverse degree index over all graphs on a given number of vertices with a given cyclomatic number. We also deduce some structural properties of extremal graphs. Some open questions regarding the upper bound over the same class of graphs are discussed and some possible further developments are indicated.
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.
