Proving a conjecture concerning trees with maximal reduced reciprocal Randić index

zbMATH Open1461.05069MaRDI QIDQ5280046FDOQ5280046

Authors: Xiangyu Ren, Biao Zhao, Xiaomin Hu 

Publication date: 19 July 2017

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

zbMATH Keywords

Zagreb indexvertex-degree-based invariant

Mathematics Subject Classification ID

Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Vertex degrees (05C07) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)

Cited In (5)

• Three new/old vertex-degree-based topological indices
• 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
• Proof of a conjecture of McEliece regarding the expansion index of the minimal trellis

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)