Extremal graphs of GQ Index with given minimum degree and their comparison with ABC and Randi´c Index

The Geometric-Quadratic index $(GQ)$ of a graph G is defined as GQ(G) = ∑ξ ψ ∈ E(G) √ 2d_ξ d_ψ dξ² + dψ² where d_ξ represents the degree of vertex ξ, is studied within the class of G(μ,) of simple connected graph with vertices with the minimum of degree μ. The primary theoretical contribution of this article is the characterization of minimizing graphs for vast range of parameters, we provide that when either μ or even, the extremal graph that minimizes the GQ index is necessarily μ-regular. Moreover, we also determine the extremal graph G that minimize the Geometric-Quadratic value or the lower bound for all μ ≥ μ₀, with μ₀=₀ (-1) and ₀≈1 is found to be the unique positive solution to the equation (1+) √²+1-2√2=0. In such cases where extremal graphs are not explicitly identified, the corresponding lower bound is established. The comparative analysis between the ABC and Randi\'{c} index serves to contextualize the GQ index within the existing molecular descriptors revealing its unique structural sensitivity and validating its potential for application in chemoinformatics. Finally, we derive specialized bounds for the GQ index for chemical trees and molecular graphs.