The maximal geometric-arithmetic energy of trees with at most two branched vertices
From MaRDI portal
Publication:2286042
Recommendations
Cites work
- Complete solution to a conjecture on the maximal energy of unicyclic graphs
- Extremal values of energy over oriented bicyclic graphs
- Graph energy
- scientific article; zbMATH DE number 4074878 (Why is no real title available?)
- Minimal energies of trees with three branched vertices
- On extremum geometric-arithmetic indices of (molecular) trees
- On the extremal energies of trees
- On the geometric-arithmetic index
- On the geometric-arithmetic index of a graph
- On upper bounds for the geometric-arithmetic topological index
- Ordering of the trees by minimal energies
- Spectral properties of geometric-arithmetic index
- Spectral study of the geometric-arithmetic index
- The geometric-arithmetic index and the chromatic number of connected graphs
- The proof of a conjecture on the comparison of the energies of trees
- Topological index based on the ratios of geometrical and arithmetical means of end-vertex degrees of edges
Cited in
(6)- Degree-based energies of trees
- On the spread of the geometric-arithmetic matrix of graphs
- scientific article; zbMATH DE number 7427075 (Why is no real title available?)
- On the maximal energy tree with two maximum degree vertices
- Extremal arithmetic-geometric index of bicyclic graphs
- Geometric-arithmetic index-energy predicting the physical properties of alkanes
This page was built for publication: The maximal geometric-arithmetic energy of trees with at most two branched vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2286042)