Proving a conjecture concerning trees with maximal reduced reciprocal Randić index
From MaRDI portal
Publication:5280046
Recommendations
- On the maximal RRR index of trees with many leaves
- A note on the minimum reduced reciprocal Randić index of \(n\)-vertex unicyclic graphs
- On the bicyclic graphs with minimum reduced reciprocal randic index
- Three new/old vertex-degree-based topological indices
- More on the best upper bound for the Randić index \(R_{-1}\) of trees
Cited in
(5)- Proof of a conjecture of McEliece regarding the expansion index of the minimal trellis
- Note on extremal graphs with given matching number
- On the bicyclic graphs with minimum reduced reciprocal randic index
- On the maximal RRR index of trees with many leaves
- Three new/old vertex-degree-based topological indices
This page was built for publication: Proving a conjecture concerning trees with maximal reduced reciprocal Randić index
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5280046)