Abstract
The Randić index is among the most famous degree-based topological indices in chemical graph theory. It was introduced due to its application in modeling the properties of certain molecular structures and has been extensively studied. In this paper, we study the lower bound of the Randić index of trees in terms of the order and the total domination number. Finally, trees with the minimal Randić index are characterized.
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference18 articles.
1. Introduction to Graph Theory;West,2001
2. Handbook of Molecular Descriptors;Todeschini,2000
3. Molecular Connectivity in Structure-Activity Analysis;Kier,1986
4. Characterization of molecular branching
5. Total domination in graphs
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献