The maximal geometric-arithmetic energy of trees with at most two branched vertices

DOI10.1016/j.amc.2019.06.042zbMath1433.05209WikidataQ127551728 ScholiaQ127551728MaRDI QIDQ2286042

Yanling Shao, Yu-Bin Gao

Publication date: 9 January 2020

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2019.06.042

zbMATH Keywords

tree; geometric-arithmetic index; geometric-arithmetic energy

Mathematics Subject Classification ID

05C05: Trees

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

92E10: Molecular structure (graph-theoretic methods, methods of differential topology, etc.)

Related Items

On the spread of the geometric-arithmetic matrix of graphs, Degree-based energies of trees

Cites Work

• Complete solution to a conjecture on the maximal energy of unicyclic graphs
• Spectral properties of geometric-arithmetic index
• Ordering of the trees by minimal energies
• Topological index based on the ratios of geometrical and arithmetical means of end-vertex degrees of edges
• On the geometric-arithmetic index of a graph
• The proof of a conjecture on the comparison of the energies of trees
• Extremal values of energy over oriented bicyclic graphs
• The geometric-arithmetic index and the chromatic number of connected graphs
• Graph Energy
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item