General Randić index of trees with given number of branching vertices
From MaRDI portal
Publication:6132861
DOI10.1142/S1793830922501075zbMATH Open1516.05037OpenAlexW4224986624MaRDI QIDQ6132861FDOQ6132861
Authors: Tomáš Vetrík 
Publication date: 15 July 2023
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830922501075
Recommendations
- Sharp lower bounds for the general Randić index of trees with a given size of matching
- Bounds on the general Randić index of trees with a given maximum degree
- Trees with second minimum general Randić index for \(\alpha >0\)
- The exponent in the general Randić index
- Trees with maximum general Randić index
Trees (05C05) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Vertex degrees (05C07)
Cites Work
- Title not available (Why is that?)
- Graphs of extremal weights
- Title not available (Why is that?)
- Trees of extremal connectivity index
- General eccentric connectivity index of trees and unicyclic graphs
- Sharp lower bounds for the general Randić index of trees with a given size of matching
- Minimum general Randić index on chemical trees with given order and number of pendent vertices
- Conjugated trees with minimum general Randić index
- General Randić index on trees with a given order and diameter
- Trees with a given order and matching number that have maximum general Randić index
- Trees with maximum general Randić index
- On the extremal Zagreb indices of trees with given number of segments or given number of branching vertices
- The general Randić index of trees with given number of pendent vertices
- Bounds on the general Randić index of trees with a given maximum degree
Cited In (3)
This page was built for publication: General Randić index of trees with given number of branching vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132861)
