Abstract
For a connected simple graph G, the inverse degree index and forgotten index are defined as and respectively, where denotes the degree of vertex u in G. In this article, we use some graph transformations and introduce a method for determining the extremal values of inverse degree index and forgotten index on the class of unicyclic 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 callMore From: AKCE International Journal of Graphs and Combinatorics
Disclaimer: 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.
