On extremum geometric-arithmetic indices of (molecular) trees
From MaRDI portal
Publication:5156367
Recommendations
Cited in
(18)- Upper bound for the geometric-arithmetic index of trees with given domination number
- On geometric-arithmetic index
- Graphs that minimizing max-min rodeg index
- The reduced Sombor index and the exponential reduced Sombor index of a molecular tree
- On exponential geometric-arithmetic index of graphs
- The maximal geometric-arithmetic energy of trees with at most two branched vertices
- scientific article; zbMATH DE number 6127699 (Why is no real title available?)
- The tree with the minimal \(GA_2\) among all the trees with diameter \(d\)
- The geometric-arithmetic index of trees with a given total domination number
- A unified approach to extremal trees with respect to geometric-arithmetic, Szeged and edge Szeged indices
- scientific article; zbMATH DE number 7771350 (Why is no real title available?)
- Molecular trees with the sixth, seventh and eighth minimal irregularity values
- Molecular graphs with extremal first geometric-arithmetic index.
- Bicyclic graphs with maximum geometric-arithmetic index
- More results on extremum Randic indices of (molecular) trees
- Extremal trees for the geometric-arithmetic index with the maximum degree
- Sharp bounds on the arithmetic-geometric index of graphs and line graphs
- CMMSE 18: geometric-arithmetic index and line graph
This page was built for publication: On extremum geometric-arithmetic indices of (molecular) trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5156367)