Authors:
Alain Hertz, Sébastien Bonte, Gauvain Devillez, Valentin
Dusollier, Hadrien Mélot, David Schindl
Abstract
The arithmetic-geometric index is a newly proposed degree-based graph invariant in mathematical chemistry. We give a
sharp upper bound on the value of this invariant for connected chemical graphs of given order and size and characterize
the connected chemical graphs that reach the bound.
We also prove that the removal of the constraint that extremal chemical graphs must be connected does not allow to
increase the upper bound.
