Bounds on the general Randić index of trees with a given maximum degree
From MaRDI portal
Publication:3556941
zbMATH Open1193.92092MaRDI QIDQ3556941FDOQ3556941
Authors: Huiqing Liu, Xun Yan, Zheng Yan 
Publication date: 26 April 2010
Recommendations
Applications of graph theory (05C90) Trees (05C05) Chemistry (92E99) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Cited In (20)
- On the tree with maximum general Randić index.
- Title not available (Why is that?)
- Bicyclic graphs with maximum general Randić index
- On general sum-connectivity index of trees of fixed maximum degree and order
- A note on extremal trees with degree conditions
- Extremal trees with given degree sequence for the Randić index
- Sharp lower bounds for the general Randić index of trees with a given size of matching
- Solutions to two unsolved questions on the best upper bound for the Randić index \(R_{-1}\) of trees
- Title not available (Why is that?)
- The general Randić index of trees with given number of pendent vertices
- Trees with maximum general Randić index
- Survey on the general Randić index: extremal results and bounds
- Extremal trees for the general Randić index with a given domination number
- General Randić index of trees with given number of branching vertices
- Trees with a given order and matching number that have maximum general Randić index
- Two results on extremal chemical trees with maximum general Randić index \(R_\alpha\) for \(\alpha<0\)
- General Randić index on trees with a given order and diameter
- The generalized Randić index of trees
- On the ordering of trees with the general Randić index of the Nordhaus-Gaddum type
- General sum-connectivity index and general Randic index of trees with given maximum degree
This page was built for publication: Bounds on the general Randić index of trees with a given maximum degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3556941)
