
Summary: For trees with given number of vertices \(n\) and maximum degree \(\Delta\), we present lower bounds on the general sum-connectivity index \(\chi_a\) if \(a >0\) and \(3 \leq \Delta \leq n -1\), and an upper bound on the general Randić index \(R_a\) if \(-0.283\leq a <0\) and \(3 \leq \Delta \leq \lfloor \frac{n-1}{2}\rfloor\). All the extremal trees for our bounds are given.
Graphical indices (Wiener index, Zagreb index, Randić index, etc.), general sum-connectivity index, Chemical graph theory, maximum degree, general randic index, general Randić index, QA1-939, Vertex degrees, Molecular structure (graph-theoretic methods, methods of differential topology, etc.), Mathematics, tree
Graphical indices (Wiener index, Zagreb index, Randić index, etc.), general sum-connectivity index, Chemical graph theory, maximum degree, general randic index, general Randić index, QA1-939, Vertex degrees, Molecular structure (graph-theoretic methods, methods of differential topology, etc.), Mathematics, tree
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 6 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
