Do older adults take action to reduce fall risk after attending a community-based fall risk screening?

1.   Introduction

A topological index is a single number, representing a chemical structure in graph-theoretical terms, which correlates with a molecular property. The concept of topological indices began with the work of Harold Wiener in the 1940s ^[42], particularly in relation to chemical graph theory. His Wiener index, which quantifies the branching of a molecular structure by counting the sum of distances between all pairs of vertices in a graph, laid the groundwork for subsequent research.

Since then, numerous topological indices have been developed, each capturing different aspects of molecular structure and properties. Examples include the Zagreb indices and the Randić index, among many others. These indices are used to correlate structural features with various chemical properties, aiding in the prediction of physical and chemical behaviors of compounds. For additional approaches related to topological indices and their applications, see ^[1,3,28].

The first and second Zagreb indices, which we denote $M_1$ and $M_2$, respectively, are defined (see ^[18]) by

where $V(G)$ and $E(G)$ denote the set of vertices and edges of the graph $G$, respectively, and $d_x$ denotes the degree (the number of neighbors) of the vertex $x$.

In ^[5,23,27] the general first and second Zagreb indices are introduced as

respectively.

Note that $M_1^{ \alpha}$ generalizes the first Zagreb index $M_1$, the inverse index $ID(G)$ ^[12], the forgotten index $F(G)$, etc.; also, $M_2^{ \alpha}$ generalizes the Randić index, the second Zagreb index $M_2$, the modified Zagreb index ^[29], etc.

The concept of variable topological indices offers a flexible approach to characterizing molecular structures, especially when it comes to heteroatoms and the structural differences between acyclic and cyclic components in molecules like alkylcycloalkanes (see ^[32,33,34]). By allowing the variables to be optimized during regression analysis, the method aims to minimize the standard error of the estimate for a given property. This adaptability can lead to more accurate and reliable models for predicting molecular behavior and properties, making it a valuable tool in cheminformatics and molecular modeling.

The sum-connectivity index was introduced in ^[43]. It has been shown that it correlates well with the $\pi$-electronic energy of benzenoid hydrocarbons ^[24]. In ^[25] appear more applications of this index. This index was extended to the general sum-connectivity index in the paper ^[44], which is defined as

Notice that $\chi_{_{1}}$ is the first Zagreb index, $\chi_{_{-1}}$ is half the harmonic index, and $\chi_{_{-1/2}}$ is the sum-connectivity index.

There are relationships between all these indices (see e.g. ^[13,14]).

If $\alpha, \beta$ are arbitrary real numbers, the Gutman-Milovanović index is defined in ^[16] by

This index is a natural generalization of the first Zagreb, the general second Zagreb, and the general sum-connectivity indices.

Notice that $M_{0, 1}$ is the first Zagreb index $M_1$, $M_{1, 0}$ is the second Zagreb index $M_2$, $M_{-1/2, 0}$ is the Randić index $R$, $2M_{1/2, -1}$ is the geometric-arithmetic index $GA$, $\frac12 M_{-1/2, 1}$ is the arithmetic-geometric index $AG$, $M_{0, -1/2}$ is the sum-connectivity index $\chi$, $2M_{0, -1}$ is the harmonic index $H$, $M_{ \alpha, 0}$ is the general second Zagreb index $M_2^{ \alpha}$, $M_{0, \beta}$ is the general sum-connectivity index $\chi_{_ \beta}$, and $4M_{1, -2}$ is the harmonic-arithmetic index $HA$ ^[2], etc. In all these examples we have $\alpha \neq \beta$, but we can also obtain known indices when $\alpha = \beta$: the third redefined Zagreb index (also called the second Gourava index) if $\alpha = \beta = 1$ (see ^[20]), the second hyper-Gourava index if $\alpha = \beta = 2$ (see ^[19]), and the Gourava product-connectivity index if $\alpha = \beta = 1/2$ (see ^[21]).

Note that the definition of $M_{ \alpha, \beta}$ in ^[16] is slightly different, but it is equivalent to this one.

The purpose of this paper is to provide new inequalities for the Gutman-Milovanović index. Moreover, the characterization of extremal graphs with respect to many of these inequalities is obtained (by extremal graphs, we mean graphs for which the inequality is, in fact, an equality). Also, some applications are given to the study of the physicochemical properties of polycyclic aromatic hydrocarbons (PAHs). The physicochemical properties of these compounds studied are boiling point, entropy, acentric factor, octanol-water partition coefficient, Kovats retention index and enthalpy of formation.

One of the novelties of studying this index for all parameter values is that it allows obtaining results for many of the known indices in a unified way. On the other hand, this characteristic also introduces the main technical difficulty, since it is necessary to search for arguments that work for all parameter values.

2.   Main inequalities

Given positive integers $\delta \le \Delta$ and $a\in \mathbb{R}$, let us define the constants $c_{a} = c_{a}(\delta, \Delta)$ and $C_{a} = C_{a}(\delta, \Delta)$ as follows:

If $a \ge 0$, then

If $a \le -1$, then

If $a = -1/2$, then

If $-1/2 < a < 0$ and $(a+1) \delta+a \Delta \ge 0$, then

If $-1/2 < a < 0$ and $(a+1) \delta+a \Delta < 0$, then

If $-1 < a < -1/2$ and $(a+1) \Delta+a \delta \le 0$, then

If $-1 < a < -1/2$ and $(a+1) \Delta+a \delta > 0$, then

Recall that a biregular graph is a bipartite graph for which any vertex in one side of the given bipartition has degree $\Delta$ and any vertex in the other side of the bipartition has degree $\delta$. We say that a graph is $(\Delta, \delta)$-biregular if we want to write explicitly the maximum and minimum degrees.

Proposition 2.1. Let $G$ be a graph with $m$ edges, minimum degree $\delta$, and maximum degree $\Delta$, and $a \in \mathbb{R}$. Then,

If $c_{a}$ (respectively, $C_{a}$) is equal to $2 \delta^{2a+1}$ or $2 \Delta^{2a+1}$, then we have $M_{a, 1}(G) = c_{a} m$ (respectively, $M_{a, 1}(G) = C_{a} m$) for every regular graph $G$.

If $c_{a}$ (respectively, $C_{a}$) is equal to $(\Delta \delta)^{a}(\Delta+ \delta)$, then we have $M_{a, 1}(G) = c_{a} m$ (respectively, $M_{a, 1}(G) = C_{a} m$) for every biregular graph $G$.

Proof. We are going to compute the extremal values of the next function $\Lambda: [\delta, \Delta] \times [\delta, \Delta] \to \mathbb{R}$ of class $C^{\infty}$ given by

We will prove that $c_a \le \Lambda(x, y) \le C_a$ for every $\delta \le x, y \le \Delta$, then $c_a \le (d_u+ d_v)(d_u d_v)^{a} \le C_a$ for every edge $uv \in E(G)$, and so, $c_a m \le M_{a, 1}(G) \le C_a m$.

Since $c_a$ and $C_a$ have different expressions depending on the values of $a$, it will be necessary to consider several cases in the proof depending on the values of $a$.

The partial derivatives of $\Lambda$ are

If $a \ge 0$, then $\partial \Lambda/\partial x, \partial \Lambda/\partial y > 0$ and so,

If $a \le -1$, then $\partial \Lambda/\partial x, \partial \Lambda/\partial y < 0$ and so,

If $a = -1/2$, then

and it is well known that

We just need to consider the cases $-1/2 < a < 0$ and $-1 < a < -1/2$.

(A) Assume first $-1/2 < a < 0$. By symmetry, it suffices to study the function $\Lambda$ on the set $A = \{(x, y) \in [\delta, \Delta] \times [\delta, \Delta]: x \ge y\}$. If $(x_0, y_0)$ is a critical point of $\Lambda$, then $\nabla \Lambda(x_0, y_0) = 0$ and

Thus, we have $(x_0, y_0) = (0, 0) \notin A$. Since there are no critical points of $\Lambda$ in $A$, the extremal values of $\Lambda$ are attained on the boundary $\partial A$.

On the set $\{ \delta\le x = y \le \Delta \} \subset \partial A$ one gets $\Lambda(x, x) = 2x^{2a+1}$. Since $2a+1 > 0$, we have $2 \delta^{2a+1} \le \Lambda(x, x) \le 2 \Delta^{2a+1}$.

In order to deal with $[\delta, \Delta] \times \{ \delta \} \subset \partial A$, let us consider the function $\gamma(x) = \Lambda(x, \delta)$. Thus, $\gamma'(x) = x^{a-1} \delta^{a} \big((a+1) x + a\, \delta \big)$. Since $a+1 > -a$, we have

Therefore,

In order to deal with $\{ \Delta \} \times [\delta, \Delta] \subset \partial A$, let us consider the function $\sigma(y) = \Lambda(\Delta, y)$. Thus, $\sigma'(y) = y^{a-1} \Delta^{a} \big((a+1) y + a\, \Delta \big) = 0$ if and only if

Note that $-1/2 < a < 0$ implies $a+1 > -a$, and so,

(A.1) If $(a+1) \delta+a \Delta \ge 0$, then $-a \Delta/(a+1) \le \delta$, and so,

if $y \in (\delta, \Delta]$. Hence,

Consequently,

(A.2) If $(a+1) \delta+a \Delta < 0$, then $\delta < -a \Delta/(a+1) < \Delta$. Since $2a+1 > 0$,

Since $\sigma'$ has a single zero, we have

Consequently,

(B) Assume now $-1 < a < -1/2$. By symmetry, it suffices to study the function $\Lambda$ on the set $B = \{(x, y) \in [\delta, \Delta] \times [\delta, \Delta]: y \ge x\}$. As in the previous case, the extremal values of $\Lambda$ are attained on the boundary $\partial B$.

On the set $\{ \delta\le x = y \le \Delta \} \subset \partial B$ one gets $\Lambda(x, x) = 2x^{2a+1}$. Since $2a+1 < 0$, we have $2 \Delta^{2a+1} \le \Lambda(x, x) \le 2 \delta^{2a+1}$.

In order to deal with $[\delta, \Delta] \times \{ \Delta \} \subset \partial B$, let us consider the function $\eta(x) = \Lambda(x, \Delta)$. Thus, $\eta'(x) = x^{a-1} \Delta^{a} \big((a+1) x + a\, \Delta \big)$. Since $a+1 < -a$, we have

Therefore,

In order to deal with $\{ \delta \} \times [\delta, \Delta] \subset \partial B$, let us consider the function $\mu(y) = \Lambda(\delta, y)$. Thus, $\mu'(y) = y^{a-1} \delta^{a} \big((a+1) y + a\, \delta \big) = 0$ if and only if

Note that $-1 < a < -1/2$ implies $a+1 < -a$, and so,

(B.1) If $(a+1) \Delta+a \delta \le 0$, then $-a \delta/(a+1) \ge \Delta$, and so,

if $y \in [\delta, \Delta)$. Hence,

Consequently,

(B.2) If $(a+1) \Delta+a \delta > 0$, then $\delta < -a \delta/(a+1) < \Delta$. Since $2a+1 < 0$,

Hence,

Consequently,

If $G$ is a regular graph, then $M_{a, 1}(G) = 2 \delta^{2a+1} = 2 \Delta^{2a+1}$. Consequently, if $c_{a}$ (respectively, $C_{a}$) is equal to $2 \delta^{2a+1}$ or $2 \Delta^{2a+1}$, then we have $M_{a, 1}(G) = c_{a} m$ (respectively, $M_{a, 1}(G) = C_{a} m$) for every regular graph $G$.

If $G$ is a biregular graph, then $M_{a, 1}(G) = (\Delta+ \delta)(\Delta \delta)^{a}$. Consequently, if $c_{a}$ (respectively, $C_{a}$) is equal to $(\Delta+ \delta)(\Delta \delta)^{a}$, then we have $M_{a, 1}(G) = c_{a} m$ (respectively, $M_{a, 1}(G) = C_{a} m$) for every biregular graph $G$. □

Remark 2.2. It is natural to wonder about equality in inequalities in Proposition 2.1 when the values of the constants are not equal to $2 \delta^{2a+1}$, $2 \Delta^{2a+1}$, or $(\Delta \delta)^{a}(\Delta+ \delta)$. Although these inequalities are very good in these cases as well, equality is not achieved for any graph at almost every value of the parameter $a \in \mathbb{R}$, as the following example shows:

Assume for instance (the other cases are similar) that $-1/2 < a < 0$, $(a+1) \delta+a \Delta < 0$, as in Case (A.2), and

Hence,

The argument in the proof of Proposition 2.1 provides that

And so, the equality $M_{a, 1}(G) = c_{a} m$ is attained if and only if every edge in $E(G)$ has vertices with degrees $\Delta$ and $\frac{-a}{a+1} \, \Delta$. This can happen just if $k = \frac{-a}{a+1} \, \Delta$ is a positive integer, and then

Hence, for almost every value of $a$ (when $a \in \mathbb{R} \setminus \mathbb{Q}$), there is no graph attaining the equality $M_{a, 1}(G) = c_{a} m$.

Corollary 2.3. Given $a \in \mathbb{R}$ and integers $1 \le \delta \le \Delta$, we have $c_{a} \le C_{a}$, and $c_{a} = C_{a}$ if and only if $\delta = \Delta$.

Proof. Let $J = [\delta, \Delta] \times [\delta, \Delta]$ and let $\Lambda: J \to \mathbb{R}$ be the function defined as

Then the argument in the proof of Proposition 2.1 gives that

The statement follows since $\Lambda$ is not constant if $\delta < \Delta$. □

Given positive integers $\delta \le \Delta$ and $\alpha, \beta\in \mathbb{R}$, let us define the constants $c_{ \alpha, \beta} = c_{ \alpha, \beta}(\delta, \Delta)$ and $C_{ \alpha, \beta} = C_{ \alpha, \beta}(\delta, \Delta)$ as follows:

If $\beta > 0$, then

If $\beta < 0$, then

If $\beta = 0$ and $\alpha \ge 0$, then

If $\beta = 0$ and $\alpha < 0$, then

Theorem 2.4. Let $G$ be a graph with $m$ edges, minimum degree $\delta$, and maximum degree $\Delta$, and $\alpha, \beta \in \mathbb{R}$. Then,

If $c_{ \alpha, \beta}$ (respectively, $C_{ \alpha, \beta}$) is equal to $2^ \beta \delta^{2 \alpha+ \beta}$ or $2^ \beta \Delta^{2 \alpha+ \beta}$, then we have $M_{ \alpha, \beta}(G) = c_{ \alpha, \beta} \, m$ (respectively, $M_{ \alpha, \beta}(G) = C_{ \alpha, \beta} \, m$) for every regular graph $G$.

If $c_{ \alpha, \beta}$ (respectively, $C_{ \alpha, \beta}$) is equal to $(\Delta \delta)^ \alpha(\Delta + \delta)^{ \beta}$, then we have $M_{ \alpha, \beta}(G) = c_{ \alpha, \beta} \, m$ (respectively, $M_{ \alpha, \beta}(G) = C_{ \alpha, \beta} \, m$) for every biregular graph $G$.

Proof. The argument in the proof of Proposition 2.1 implies that

for every $a\in \mathbb{R}$ and $\delta \le x, y \le \Delta$. Hence, if $\beta \neq 0$ and we take $a = \alpha/ \beta$, we have

for every $\delta \le x, y \le \Delta$.

If $\beta > 0$, then

for every $\delta \le x, y \le \Delta$.

If $\beta < 0$, then

for every $\delta \le x, y \le \Delta$.

If $\beta = 0$ and $\alpha \ge 0$, then

for every $\delta \le x, y \le \Delta$.

If $\beta = 0$ and $\alpha < 0$, then

for every $\delta \le x, y \le \Delta$.

Therefore, we have for every $\alpha, \beta \in \mathbb{R}$,

for every $uv \in E(G)$, and so,

The statements on the equalities follow from the argument in the proof of Proposition 2.1. □

The argument in the proof of Corollary 2.3 has the following consequence.

Corollary 2.5. Given $\alpha, \beta \in \mathbb{R}$ and integers $1 \le \delta \le \Delta$, we have $c_{ \alpha, \beta} \le C_{ \alpha, \beta}$; also, $c_{ \alpha, \beta} = C_{ \alpha, \beta}$ if and only if $\delta = \Delta$.

The following inequality relating two $M_{ \alpha, \beta}$ indices is direct.

Proposition 2.6. Let $G$ be a graph and $\alpha, \beta, \alpha', \beta' \in \mathbb{R}$ with $\alpha \le \alpha'$ and $\beta \le \beta'$. Then,

Theorem 2.4 allows us to prove the following inequality relating two $M_{ \alpha, \beta}$ indices.

Theorem 2.7. Let $G$ be a graph with minimum degree $\delta$, and maximum degree $\Delta$, and $\alpha, \beta, \alpha', \beta' \in \mathbb{R}$. Then,

Proof. The argument in the proof of Theorem 2.4 implies that

for every $uv \in E(G)$, and so,

□

Recall that $M_2^{-1/2}$ is the Randić index $R$, $\chi_{_{-1/2}}$ is the sum-connectivity index $S$, and $2\chi_{_{-1}}$ is the harmonic index $H$. Thus, Theorem 2.7 has the following consequence.

Corollary 2.8. Let $G$ be a graph with minimum degree $\delta$, maximum degree $\Delta$, and $\alpha, \beta, \alpha', \beta' \in \mathbb{R}$. Then,

The geometric-arithmetic and the arithmetic-geometric indices are defined, respectively, as

The geometric-arithmetic index is a good predictor of the heat of formation of benzenoid hydrocarbons, and it has been extensively studied (see, e.g., ^{[6,7,8,9,35,36]}).

In ^[4,10] (see also ^[37]), the variable geometric-arithmetic index was defined by

Theorem 2.7 also has the following consequence.

Corollary 2.9. Let $G$ be a graph with minimum degree $\delta$, maximum degree $\Delta$, and $\alpha, \beta, a \in \mathbb{R}$. Then,

Corollary 2.9 has the following consequence for the geometric-arithmetic and the arithmetic-geometric indices.

Corollary 2.10. Let $G$ be a graph with minimum degree $\delta$, maximum degree $\Delta$, and $\alpha, \beta \in \mathbb{R}$. Then,

In ^[40,41], a family of Adriatic indices is introduced. An especially interesting subclass of these descriptors consists of 148 discrete Adriatic indices. Most of the indices showed good predictive properties on the testing sets provided by the International Academy of Mathematical Chemistry. Twenty of them were selected as good predictors. The inverse sum indeg index, $ISI$, is an Adriatic index that was selected in ^[41] as a significant predictor of the total surface area of octane isomers. This index was defined by

In the last years there has been an increasing interest in this index (see, e.g., ^{[11,15,17,30]}).

Theorem 2.7 provides inequalities relating the inverse sum indeg and the Gutman-Milovanović indices.

Corollary 2.11. Let $G$ be a graph with minimum degree $\delta$, maximum degree $\Delta$, and $\alpha, \beta \in \mathbb{R}$. Then,

3.   Other inequalities

The following result is a useful and well-known inequality (see, e.g., [26, Lemma 3.4] for a proof of the statement of equality).

Lemma 3.1. If $a_i, b_i\ge 0$ and $M b_i \le a_i \le N b_i$ for $1\le i \le k$ and some positive constants $M, N,$ then

If $a_i > 0$ for some $1\le i \le k$, then the equality holds if and only if $M = N$ and $a_i = M b_i = N b_i$ for every $1\le i \le k$.

Lemma 3.1 allows us to obtain the following result relating $M_{ \alpha, \beta}$, the general second Zagreb index and the general sum-connectivity index.

Theorem 3.2. Let $G$ be a graph with minimum degree $\delta$, maximum degree $\Delta$, and $\alpha, \beta \in \mathbb{R}$. Then,

where $c_{ \alpha, - \beta}, C_{ \alpha, - \beta}$ are the constants in Theorem 2.4. The equality in the bound is attained if and only if $G$ is regular.

Proof. The argument in the proof of Theorem 2.4 gives

for every $\alpha, \beta \in \mathbb{R}$ and $uv \in E(G)$ and so, we have

for every $\alpha, \beta \in \mathbb{R}$ and $uv \in E(G)$. Hence, by applying Lemma 3.1, we obtain

By Lemma 3.1, the equality in this bound is attained if and only if $C_{ \alpha, - \beta} = c_{ \alpha, - \beta}$; Corollary 2.5 gives that this happens if and only if $\delta = \Delta$, i.e., $G$ is regular. □

The following results relate to the Gutman-Milovanović, the general second Zagreb and the general sum-connectivity indices.

Theorem 3.3. Let $G$ be a graph and $p, \alpha, \beta \in \mathbb{R}$ with $p > 1$. Then,

Proof. By applying Young's inequality, we obtain

□

Young's inequality is a very important result in analysis, since it is a key tool in the proof of Hölder's inequality. Its reverse inequality was given in ^[39] with Specht's ratio as follows:

where the Specht's ratio ^[38] is defined on $\mathbb{R}^+$ as

In ^[31] appears the following version of (3.1) for $n$ real numbers, improving Specht's ratio.

Theorem 3.4. If $0 < a < 1$, $p_1, \dots, p_n > 1,$ and $x_1, \dots, x_n \ge 0$ are real numbers such that $\frac{1}{p_1}+ \dots +\frac{1}{p_n} = 1$ and $a\, x_k^{p_k} \le x_i^{p_i}$ for $1 \le i, k \le n$, then there exists a positive constant $A$, which just depends on $a, p_1, \dots, p_n,$ such that

In fact, if $\mathcal{P}_n$ denotes the group of permutations of $\{1, \dots, n\}$, then the best value of $A$ is the maximum on the following finite set:

Corollary 3.5. If $0 < a < 1$, $p, q > 1$ and $x, y \ge 0$ are real numbers such that $\frac{1}{p}+ \frac{1}{q} = 1$ and $a\, x^{p} \le y^{q}$, $a\, y^{q} \le x^{p}$, then

with

Theorem 3.6. Let $G$ be a graph and $p, \alpha, \beta \in \mathbb{R}$ with $p > 1$. Then,

where

Proof. The argument in the proof of Theorem 2.4 gives

for every $uv \in E(G)$.

In order to apply Corollary 3.5, note that

Taking into account the definitions of $a_{ \alpha, \beta, p}$ and $A_{ \alpha, \beta, p}$, Corollary 3.5 implies

□

4.   Analysis of the predictive power of $M_{\alpha, \beta}$ for physicochemical properties of PAHs

In this section, we assess the predictive power of the topological index $M_{ \alpha, \beta}$ in modeling the boiling point ($BP$), entropy ($S$), acentric factor ($\omega$), octanol-water partition coefficient ($\log P$), Kovats retention index ($RI$), and enthalpy of formation ($\Delta H_f$) of 22 polycyclic aromatic hydrocarbons. The experimental data for these physicochemical properties were obtained from ^[22].

We first calculated the coefficient of determination ($R^2$) for each property between the experimental data and $M_{\alpha, \beta}$. The parameters $\alpha$ and $\beta$ were varied systematically over a grid ranging from $-20$ to $20$ with a step size of $0.1$. Figure 1 shows grayscale maps of the $R^2$ values obtained from the variation of $\alpha$ and $\beta$, where darker regions indicate higher $R^2$ values. Subsequently, the optimal values of $\alpha$ and $\beta$ that maximize $R^2$ in each case were identified; these are represented as red points in the same figure. The selection of the optimal combination is based on the pair of $\alpha$ and $\beta$ that yields the maximum $R^2$ within the explored grid, ensuring the best linear relationship between $M_{\alpha, \beta}$ and the property. This systematic grid search guarantees comprehensive coverage of the parameter space, and the chosen step size balances computational feasibility with precision.

Once the optimal values of $\alpha$ and $\beta$ are obtained, linear models of the form

are constructed, where $\mathcal{P}$ represents the physicochemical property, and the coefficients $c_1$ and $c_2$ are determined using the linear regression method. After determining the linear models for each physicochemical property, the results are summarized as follows:

The performance of these linear models was evaluated, and the results are presented in Figure 2, which shows the correlation between the predicted (red line) and experimental values (blue dots) for each physicochemical property.

The analysis of the predictive power of the topological index $M_{\alpha, \beta}$ for modeling the physicochemical properties of polycyclic aromatic hydrocarbons reveals several key insights. The $R^2$ values obtained for the various properties, ranging from 0.9406 for entropy to 0.9983 for the Kovats retention index, indicate a generally strong correlation between the experimental data and the predictions derived from $M_{\alpha, \beta}$. This suggests that the topological index effectively captures the underlying structural variations in PAHs that influence these properties. Notably, the high $R^2$ value for $BP$ and $RI$ implies that $M_{\alpha, \beta}$ is particularly effective in modeling these properties, likely due to the sensitivity to molecular topology. Conversely, the relatively lower $R^2$ value for $S$ and $\Delta H_f$ indicates a more complex relationship between molecular structure and these properties, which might require additional descriptors or interactions beyond those captured by $M_{\alpha, \beta}$ alone.

Furthermore, the optimal parameter combinations $(\alpha, \beta)$ vary significantly across different properties, highlighting the importance of parameter tuning for each specific property. This variability underscores the flexibility of the $M_{\alpha, \beta}$ index in adapting to different molecular interactions. However, as shown in Figure 1, the areas where the highest $R^2$ values are reached (darker areas) are similar across all properties. This suggests the possibility of identifying a combination of the parameters $\alpha$ and $\beta$ that, while not optimal for each individual property, could provide a good overall fit for all the properties considered.

Building upon the insights gained in the previous analysis, we now explore the possibility of deriving a unified parameter combination $(\alpha^*, \beta^*)$ that achieves strong correlations collectively, ensuring a robust performance for all properties.

To identify $(\alpha^*, \beta^*)$, we evaluate the average of the $R^2$ values for all properties. The $(\alpha^*, \beta^*)$ combination is determined by maximizing this average over the same parameter grid used previously ($\alpha, \beta \in [-20, 20]$, with a step size of $0.1$). In Figure 3 we show a greysacle map of the average values obtained from the variation of $\alpha$ and $\beta$ across the grid.

From these calculations we obtain $(\alpha^*, \beta^*) = (1.4, -2.6)$ (red dot in Figure 3). With this combination of parameters, a linear model is proposed for each property.

To assess the performance of the general model, we calculate the $R^2$ values for each property using $(\alpha^*, \beta^*)$ and compare them to the optimal $R^2$ values obtained for property-specific parameter combinations (see Table 2).

The results in Table 2 demonstrate that the general parameter combination $(\alpha^*, \beta^*) = (1.4, -2.6)$ provides consistently high $R^2$ values across all physicochemical properties. While the $R^2(\alpha^*, \beta^*)$ values are slightly lower than those achieved with property-specific parameter combinations, the differences are minimal (e.g., for $RI$, the difference is only $0.0035$). This indicates that the models obtained from $(\alpha^*, \beta^*)$ capture the structural features relevant to all properties effectively, making it a robust alternative for predicting multiple properties.

Next, we aim to construct and evaluate a unified model using $(\alpha^*, \beta^*)$ to simultaneously predict all physicochemical properties. This approach will enable us to assess the practicality and effectiveness of a general model in capturing the structural factors influencing diverse properties. To ensure comparability across properties, each property is normalized to the range $[0, 1]$ using the transformation,

This normalization removes scale differences and enables consistent evaluation of the generalized model. Then, the $M_{\alpha^*, \beta^*}$ index is calculated for each molecule using the general parameter combination $(\alpha^*, \beta^*)$. The normalized values of all properties are then combined into a single dataset. Thus, the general model takes the form

The performance of the unified model was evaluated by calculating the $R^2$ values for each property using the normalized data and comparing them to those from the property-specific models, as summarized in Table 2. The unified model achieves lower $R^2$ values overall, with the largest differences observed for $S$ (0.828 vs. 0.9406) and $\omega$ (0.8698 vs. 0.9827). These results indicate that while the generalized model effectively captures overall trends, it struggles with some properties.

Finally, to place the predictive power of the topological index in context, we compare its performance against well-established indices commonly used in the modeling of physicochemical properties. The selected indices are the first Zagreb index $M_1$, the second Zagreb index $M_2$, the Randić index $R$, and the inverse degree index $ID$. In Table 3 we show the $R^2$ values calculated for each property and each index.

The results in Table 3 demonstrate that $M_{\alpha, \beta}$ consistently outperforms the other indices in terms of $R^2$ values across all properties. The most pronounced differences are observed for $BP$ and $S$, where $M_{\alpha, \beta}$ shows a clear advantage. In contrast, for $\omega$ and $\log P$, the differences are smaller, with $M_{\alpha, \beta}$ performing comparably to the best alternative indices. Overall, $M_{\alpha, \beta}$ stands out as the most predictive and reliable index for modeling the physicochemical properties of PAHs.

5.   Conclusions

In this study, we have derived novel inequalities for the Gutman-Milovanović index $M_{ \alpha, \beta}$, which generalizes several important topological indices. By establishing new bounds based on the minimum and maximum degrees of graphs, we have deepened the understanding of the structural properties that influence this index. Additionally, we characterized extremal graphs that achieve these bounds, providing insights into their structural configurations and illustrating the scenarios where these inequalities are tight.

Our theoretical findings have direct implications for chemical graph theory. We demonstrated the applicability of the Gutman-Milovanović index in modeling the physicochemical properties of 22 polycyclic aromatic hydrocarbons. The high coefficients of determination $R^2$ values suggest a robust correlation between the index and experimental data, highlighting its effectiveness as a predictive tool in quantitative structure-property relationships (QSPR). The versatility of $M_{ \alpha, \beta}$ in capturing complex molecular interactions indicates its potential for applications in chemical informatics, such as drug discovery and material science.

Future research could address the complexity of properties like entropy ($S$) and enthalpy of formation ($\Delta H_f$) by integrating additional molecular descriptors, such as geometric-topological parameters or vertex distance and degree-based indices. Hybrid models combining $M_{\alpha, \beta}$ with these descriptors or non-linear techniques like machine learning could improve the predictions and uncover hidden structural patterns. Additionally, refining the parameter optimization for $\alpha$ and $\beta$ could further enhance the predictive accuracy of the Gutman-Milovanović index. Extending these inequalities to other classes of graphs and assessing the applicability to a broader range of chemical compounds, such as heterocyclic compounds or large organic molecules, remain promising directions for future exploration. A more detailed analysis of the limitations encountered in generalizing this approach could also inform the development of more tailored predictive models.

Author contributions

All the authors contributed equally to this work. All the authors have agreed and given their consent for the publication of this research paper.

Use of Generative-AI tools declaration

The authors declare they have used Artificial Intelligence (AI) tools in the creation of this article.

Conflict of interest

Prof. Jose M. Rodriguez-Garcia is the Guest Editor of special issue "Graph theory and its applications, 2nd Edition" for AIMS Mathematics. Prof. Jose M. Rodriguez-Garcia was not involved in the editorial review and the decision to publish this article.

The authors confirm that the content of this article has no conflict of interest or competing interests.