Abstract
The Randic index of an organic molecule whose molecular graph is G is defined as the sum of (d(u)d(v))−1/2 over all pairs of adjacent vertices of G, where d(u) is the degree of the vertex u in G. In Discrete Mathematics 257, 29–38 by Delorme et al. gave a best-possible lower bound on the Randic index of a triangle-free graph G with given minimum degree δ(G). In the paper, we first point out a mistake in the proof of their result (Theorem 2 of [2002]), and then we will show that the result holds when δ(G) ≥ 2.
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.
