New lower bounds for the Geometric-Arithmetic index
Abstract
The concept of geometric-arithmetic index was introduced in the chemical graph theory recently, but it has shown to be useful. The aim of this paper is to obtain new inequalities involving the geometric-arithmetic index GA1 and characterize graphs extremal with respect to them. Our main results provide lower bounds GA1(G) involving just the minimum and the maximum degree of the graph G.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.