Abstract
The inverse sum indeg (ISI) index has attracted more and more attentions, because of its significant applications in chemistry. A basic problem in the study of this topological index is the characterization trees with maximal ISI value. Let T be such a tree of order n≥20. Recently, Lin et al. (2022) claimed that T has no vertices of degree 2. However, errors were found in their proofs. Since this result is quite important, we give a correction to the proof. Furthermore, we extend the result by proving that T has no vertices of degree 2 or 3 if n≥58.
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.
