Abstract
The Randić index of an organic molecule whose molecular graph is G is the sum of the weights (d(u)d(v))−1/2 of all edges uv of G, where d(u) and d(v) are the degrees of the vertices u and v in G. We give a sharp lower bound on the Randić index of conjugated trees (trees with a perfect matching) in terms of the number of vertices. A sharp lower bound on the Randić index of trees with a given size of matching is also given
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Randić (1975) J. Amer. Chem. Soc 97 6609 Occurrence Handle10.1021/ja00856a001
L.B. Kier L.H. Hall (1976) Molecular Connectivity in Chemistry and Drug Research Academic Press San Francisco
Kier L.B., Hall L.H. Molecular Connectivity in Structure-Activity Analysis (Wiley, 1986).
Gutman I., Vidović D., Nedić A. J. Serb. Chem. Soc., in press.
I. Gutman M. Leporić (2001) J. Serb. Chem. Soc 66 605
B. Bollobás P. Erdös (1998) Ars Combin 50 225
P. Yu (1998) J. Math Study (Chinese) 31 225
Y. Hou J. Li (2002) Linear Algebra Appl 342 203 Occurrence Handle10.1016/S0024-3795(01)00465-7
Author information
Authors and Affiliations
Corresponding author
Additional information
Mei Lu: Partially supported by NNSFC (No. 60172005)
Lian-zhu Zhang: Partially supported by NNSFC (No. 10271105)
Feng Tian: Partially supported by NNSFC (No. 10431020)
Rights and permissions
About this article
Cite this article
Lu, M., Zhang, Lz. & Tian, F. On the Randić Index of Acyclic Conjugated Molecules. J Math Chem 38, 677–684 (2005). https://doi.org/10.1007/s10910-005-6892-4
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s10910-005-6892-4