Chemical applicability of GQ and QG indices of a graph and their bounds

Shibsankar Das1, Virendra Kumar1
1Department of Mathematics, Institute of Science, Banaras Hindu University, Varanasi 221005, Uttar Pradesh, India

Abstract

Topological indices have become an essential tool to investigate theoretical and practical problems in various scientific areas. In chemical graph theory, a significant research work, which is associated with the topological indices, is to deduce the ideal bounds and relationships between known topological indices. Mathematical development of the novel topological index is valid only if the topological index shows a good correlation with the physico-chemical properties of chemical compounds. In this article, the chemical applicability of the novel GQ and QG indices is calibrated over physico-chemical properties of 22 benzenoid hydrocarbons. The GQ and QG indices predict the physico-chemical properties of benzenoid hydrocarbons, significantly. Additionally, this work establishes some mathematical relationships between each of the GQ and QG indices and each of the graph invariants: size, degree sequences, maximum and minimum degrees, and some well-known degree-based topological indices of the graph.

Keywords: vertex degree, degree-based topological index, GQ index, QG index

1. Introduction

Degree-based indices have grown since topological invariants were first developed and used in Chemical Graph Theory (CGT). Nowadays, research on chemical applications and mathematical properties of degree-based topological invariants are significantly active, see [4, 13]. The reason behind the sudden increase in the introduction of these indices could be attributed to their straightforward definitions, computationally easy techniques and unexpectedly good performance in predicting the physico-chemical properties of molecules. The study of degree-based topological indices is applied mathematically to irregularity measures and metrics of graph branching [1].

Throughout this article, we consider a simple, connected and undirected graph Υ=(V(Υ),E(Υ)), with V(Υ) and E(Υ) as its vertex and edge set, respectively. The degree u of a vertex uV(Υ) is the total number of edges associated with that vertex. Also, |V(Υ)|=n and |E(Υ)|=m are the order and size of the graph, respectively. We use δ and Δ to denote the minimum degree and maximum degree of the graph Υ, respectively [41].

Since when the idea of topological molecular descriptors is employed, several notable degree-based topological descriptors have been introduced. Below we state some standard topological descriptors which will be utilized in the rest of this article.

One of the oldest degree-dependent topological indices is the Zagreb indices [19]. Gutman and Trinajstic introduced them in 1972 and defined them as follows: (1)M1(Υ)=uvE(Υ)(u+v), and (2)M2(Υ)=uvE(Υ)uv.

Despite their age, they are appropriate and significant even today and several publications on Zagreb indices are appearing [14, 20, 42].

The forgotten index was seen in the same article as the Zagreb indices [19], but it was sitting in the shadow for almost 40 years. Later, B. Furtula and I. Gutman reintroduced it in [16] and defined as follows:

(3)F(Υ)=uvE(Υ)(u2+v2).

Recently in [21, 32], the forgotten topological index of a graph and its some new inequalities are investigated.

Randić index [35] is a widely employed well-known degree-based topological index. It is defined as follows: (4)R(Υ)=uvE(Υ)1uv.

For more than 40 years, the Randić index has been studied, resulting in hundreds of publications and numerous books [3,5, 31,33]. Several improvements to this index have been put forward in order to improve its predictive potential [33]. One of such improvements is the reciprocal Randić index which is defined as (5)RR(Υ)=uvE(Υ)uv.

In 2013, the idea of the first and second hyper-Zagreb indices are proposed in [37] and they are defined as follows: (6)HM1(Υ)=uvE(Υ)(u+v)2, and (7)HM2(Υ)=uvE(Υ)(uv)2.

Later, these indices were also studied for several classes of graphs in [6, 17].

More than one decades ago, the idea of symmetric division deg index of a graph Υ is proposed in [38]. We denote it as SDD(Υ) and it is defined as (8)SDD(Υ)=uvE(Υ)(uv+vu).

Moreover, it has just lately gained a lot of interest because of its some reasonable predictive capability [2,15].

Recently, I. Gutman proposed three novel topological indices one of them was Sombor index [18], and defined as follows: (9)SO(Υ)=uvE(Υ)u2+v2.

Geometrically, the Sombor index is a measure of the distance of the point (u,v) from the origin in the 2D Cartesian coordinate system. A new method to compute the different ombor-type indices via -polynomial was proposed in [29].

Inspired by the work on Sombor index, V.R. Kulli proposed Nirmala index [23] of the graph Υ and defined as follows: (10)N(Υ)=uvE(Υ)u+v.

Further, the first inverse Nirmala index (denoted as IN1(Υ)) and second inverse Nirmala index (denoted as IN2(Υ)) of a molecular graph Υ are established by Kulli et al. [25] in 2021 which are defined as follows: (11)IN1(Υ)=uvE(Υ)1u+1v=uvE(Υ)u+vuv,

(12)IN2(Υ)=uvE(Υ)11u+1v=uvE(Υ)uvu+v.

Lately, the derivation formulas of Nirmala indices and its generalized version ((a,b)-Nirmala index) based on M-polynomials were suggested in [10,11]. Comparative study between irmala and ombor indices based on their applicability, degeneracy and smoothness was presented in [28,26]. The ordhaus-addum-type inequalities for the irmala Indices were obtained in the article [30].

In the year 2022, V.R. Kulli proposed two novel topological indices based on the geometric and quadratic mean of degrees of end vertices of an edge uvE(Υ). They are named as geometric-quadratic (GQ) and quadratic-geometric (QG) indices [24]. The mathematical definitions of the GQ and QG indices are:

(13)GQ(Υ)=uvE(Υ)2uvu2+v2, and (14)QG(Υ)=uvE(Υ)u2+v22uv.

The computation of the GQ and QG indices for some standard graphs and jagged-rectangle benzenoid system was reported in [24,8]. The GQ and QG indices-based entropy measures of some silicon carbide networks were computed in [9].

Apart from the above mathematical developments on GQ and QG indices, one can find the evidence of usability of the indices in the article [12].

In this article, the authors performed the Quantitative Structure-Property Relationship (QSPR) analysis to predict the physico-chemical properties of certain well-known COVID-19 drugs, where the GQ and QG indices have shown a good correlation with some of the physico-chemical properties of the drugs. The cubic regression models corresponding to the indices with the squared correlation coefficients 0.9910 and 0.9872, respectively (determined in Table 8 of [12]), depict that the indices predict the mass (M) of the drugs significantly. For more details, readers can see Tables 8 and 9, Figure 18(b) and point number (vi) in the conclusion section of the recently published article [12]. Moreover, very recently, the authors of [27] examined the newly defined GQQG indices’ chemical applicability and compare their prediction power, degeneracy, and structural sensitivity to those of existing notable degree-based topological indices.

Table 1 GQQG indices and physico-chemical properties of 22 benzenoid hydrocarbons
 Benzenoid hydrocarbons~ Topological index Physico-chemical properties
GQ QG BP DHFORM MW logP Eπ
Benzene 6.0000 6.0000 80.1000 75.2000 78.1100 8.0000 2.1300
Naphthalene 10.8431 11.1633 218.0000 141.0000 128.1710 13.6790 3.3000
Phenanthrene 15.7646 16.2450 338.0000 202.7000 178.2340 19.5000 4.4600
Anthracene 15.6862 16.3267 340.0000 222.6000 178.2340 19.3090 4.4500
Chrysene 20.6862 21.3267 431.0000 271.1000 228.2880 25.1890 5.8100
Benzo[a]anthracene 20.6077 21.4083 425.0000 277.1000 228.2880 25.0990 5.7600
Triphenylene 20.7646 21.2450 429.0000 275.1000 228.2880 25.3010 5.4900
Tetracene 20.5292 21.4899 440.0000 310.5000 228.2880 25.2010 5.7600
Benzo[a]pyrene 23.6077 24.4083 496.0000 296.0000 252.3000 28.1990 6.1300
Benzo[e]pyrene 23.6862 24.3267 493.0000 289.9000 252.3160 28.2990 6.4400
Perylene 23.6862 24.3267 497.0000 319.2000 252.3000 28.2390 6.250
Anthanthrene 26.5292 27.4899 547.0000 323.0000 276.3310 31.1990 7.0400
Benzo[ghi]perylene 26.6077 27.4083 542.0000 301.2000 276.3310 31.3980 6.6300
Dibenzo[a,c]anthracene 25.6077 26.4083 535.0000 348.0000 278.3310 30.8990 6.0200
Dibenzo[a,h]anthracene 25.5292 26.4899 535.0000 335.0000 278.3470 30.7960 6.7500
Dibenzo[a,j]anthracene 25.5292 26.4899 531.0000 336.3000 281.3000 30.7950 6.5400
Picene 25.6077 26.4083 519.0000 336.9000 278.3000 30.8910 7.1100
Coronene 29.5292 30.4899 590.0000 296.7000 300.4000 34.6010 7.6400
Dibenzo(a,h)pyrene 28.5292 29.4899 59.00006 375.6000 302.4000 33.8550 7.2800
Dibenzo(a,i)pyrene 28.5292 29.4899 594.0000 366.0000 302.4000 33.8790 7.2800
Dibenzo(a,l)pyrene 28.6077 29.4083 595.0000 393.3000 302.4000 34.0090 7.2800
Pyrene 18.6862 19.3267 393.0000 221.3000 202.2560 22.4950 4.8800

Hence, the study of the mathematical properties and bounds of the GQ and QG indices is worthy of investigation in the field of chemical graph theory.

The rest of the manuscript is built as follows. The chemical applicability of the considered GQ and QG indices is investigated over the physico-chemical properties of 22 benzenoid hydrocarbons in Section 2. In Section 3, some tight upper and lower bounds for the GQ and QG indices in terms of size, degree sequence of a graph and the above-mentioned degree-based topological indices are established. Section 4 is reserved for the conclusion.

2. Chemical applicability of GQ and QG indices

The novel topological indices should correlate well with one of the physico-chemical properties of a molecular compound. The ability to discriminate between isomers, predictive power and smoothness of the GQ and QG indices have been investigated in article [27]. Here, we focus our attention to test the chemical applicability of the concerned indices over the physico-chemical properties of 22 benzenoid hydrocarbons. Benzenoid hydrocarbons are a specific type of organic compound with a condensed polycyclic structure made up only of hexagonal rings. It has been utilized by numerous researchers to evaluate the strength and quality of different molecular descriptors and structural invariants for QSPR/QSAR analysis [34]. These chemical graphs have notable variance, shape, non-polarity, and branching because of the diversity of their structures. Many researchers have conducted a variety of studies on benzenoid hydrocarbons, see [22, 7, 36,39]. The physico-chemical properties such as boiling point (BP), standard heat of formation (DHFORM), molecular weight (MW), log P and π-electron energy (Eπ) of benzenoid hydrocarbons are comprised from the article [7, 39]. These properties together with the computed values of GQQG indices of benzenoid hydrocarbons are cataloged in Table 1 to perform the linear regression analysis.

2.1. Linear regression model (LRM)

(15)P=p1×TI+p2, is performed for regression analysis. In Eq. (15), P denotes the physico-chemical property, TI symbolizes the topological index and pi where i=1,2 represent the fitting coefficients.

The linear regression models are performed using MATLAB R2019a software and fitting coefficients p1 and p2 are taken with 95% confidence bounds. The statistical parameters obtained from linear regression analysis are R2, AdjR2, root mean square error (RMSE) and sum of square error (SSE).

The squared of correlation-coefficient (R2) closer to 1 and RMSE near to 0 represent the goodness of a linear regression model. The linear regression models for GQ and QG indices with different physico-chemical properties of benzenoid hydrocarbons are detailed below.

(i) Boiling point (BP):

LRM for GQ index: BP=p1×GQ+p2, where coefficients (with 95% confidence bounds) p1=21.3200(20.3600,22.2800) and p2=13.9000(36.0600,8.2670).

Goodness of fit:R2=0.9908, Adj-R2=0.9903, SSE=3227 and RMSE=12.7000

LRM for QG index: BP=p1×QG+p2, where coefficients (with 95% confidence bounds) p1=20.5900(19.7300,21.4500), p2=12.6900(33.1700,7.7920).

Goodness of fit: R2=0.9921, Adj-R=0.9917 SSE=2772 and RMSE=11.7700.

(ii) Standard enthalpy of formation (DHFORM):

LRM for GQ index: DHFORM=p1×GQ+p2, where coefficients (with 95% confidence bounds) p1=11.9400(10.0000,13.8800)p2=20.3600(24.4500,65.1700).

Goodness of fit: R2=0.8917, Adj-R2=0.8863, SSE=1.319e+04 and RMSE=25.6800.

LRM for QG index: DHFORM=p1×QG+p2, where coefficients (with 95% confidence bounds): p1=11.5500(9.6980,13.4000), p2=20.7900(23.2900,64.8700).

Goodness of fit: R2=0.8946, Adj-R2=0.8893, SSE=1.284e+04 and RMSE=25.3400.

(iii) Molecular weight (MW):

LRM for molecular weight (MW): MW=p1×GQ+p2, where coefficients (with 95% confidence bounds): p1=9.7450(9.3830,10.1100), p2=23.8700(15.5000,32.2400).

Goodness of fit: R2=0.9937, Adj-R=0.9934, SSE=460 and RMSE=4.7960.

LRM for molecular weight (MW): MW=p1×QG+p2, where coefficients (with 95% confidence bounds): p1=9.4110(9.0820,9.740), p2=24.4900(16.6400,32.3400).

Goodness of fit: R2=0.9944, Adj-R2=0.9941, SSE=407.1000 and RMSE=4.5120.

(iv)

LRM for GQ index: log P=p1×GQ+p2, where coefficients (with 95% confidence bounds): p1=0.2262(0.2090,0.2435), p2=0.8776(0.4793,1.2760).

Goodness of fit: R2=0.9740, Adj-R2=0.9727, SSE=1.0420 and RMSE=0.2282.

LRM for QG index: log P=p1×QG+p2, where coefficients (with 95% confidence bounds): p1=0.2185(0.2022,0.2348), p2=0.8908(0.5024,1.2790).

Goodness of fit: R2=0.9751, Adj-R2=0.9739, SSE=0.9967 and RMSE=0.2232.

(v) π-electron energy (Eπ):

LRM for GQ index: Eπ=p1×GQ+p2, where coefficients (with 95% confidence bounds): p1=1.1380(1.1190,1.1580), p2=1.4400(0.9862,1.8930).

Goodness of fit: R2=0.9986, Adj-R2=0.9986, SSE=1.3520 and RMSE=0.2600.

LRM for QG index: Eπ=p1×QG+p2, where coefficients (with 95% confidence bounds): p1=1.0990(1.0810,1.1170), p2=1.5200(1.0820,1.9580).

Goodness of fit: R2=0.9987, Adj-R2=0.9987, SSE=1.2700 and RMSE=0.2519.

We extract the following observations from the above-performed QSPR models:

(i) GQ and QG indices predict the boiling point (BP) with the R2 0.9908 and 0.9921, respectively.

(ii) GQ and QG indices obtain the square correlation coefficient R2 0.8917 and 0.8946, respectively with the standard heat of formation (DHFORM).

(iii) GQ and QG indices forecast the molecular weight (MW) with the R2 0.9937 and 0.9944, respectively.

(iv) GQ and QG indices report the R2-values 0.9740 and 0.9751, respectively, with log P property of benzenoid hydrocarbons.

(v) GQ and QG indices predict the π-electron energy (Eπ) with the R2 0.9986 and 0.9987, respectively.

Remark 2.1. Both the GQ and QG indices predict the physico-chemical properties of benzenoid hydrocarbons significantly with the correlation-coefficient R>0.9. However, the QG indices shows the more predictive capability in comparison to the GQ index.

Figure 1 illustrates the linear regression model between the GQQG indices and the boiling point (BP) of benzenoid hydrocarbons. Figure 2 demonstrates the regression model between the GQQG indices and the standard heat of formation (ΔHform). Figure 3 depicts the relationship between the GQQG indices and molecular weight (MW). Figure 4 presents the linear regression plot between the GQQG indices and logP values of benzenoid hydrocarbons. Finally, Figure 5 shows the regression analysis between the GQQG indices and the π-electron energy (π-E).

3. Bounds of GQ and QG indices for general graph

Here, we establish some tight upper and lower bounds for the GQ and QG indices of a graph Υ in terms of its size, degree sequence and some notable degree-based topological descriptors. Before moving further, let us recall a small relation between GQ and QG indices as stated in Theorem 3.1.

Theorem 3.1. [8] Let Υ be a simple, connected and undirected graph. Then we have 0<GQ(Υ)QG(Υ).

3.1. In terms of size and degree

Here, we discuss the bounds of GQ and QG indices in terms of the size and degree of a graph.

Theorem 3.2. Let Υ be a simple, connected and undirected graph with m edges. Then δΔmGQ(Υ)mQG(Υ)Δδm.

The equality holds if and only if the graph Υ is regular.

Proof. To prove this inequality, we use the definitions of GQ and QG indices and the mathematical relation between the geometric mean and quadratic mean of two numbers.

Let us first consider the upper bound of QG index. From Eq. (14), we have (16)QG(Υ)=uvE(Υ)u2+v22uvuvE(Υ)Δ2+Δ22δδΔδm.

In a similar way from Eq. (13), we get the lower bound of GQ index as (17)GQ(Υ)=uvE(Υ)2uvu2+v2uvE(Υ)2δδΔ2+Δ2δΔm.

Next, using the mathematical relation between geometric and quadratic means of two numbers we have uvu2+v22uvu2+v221u2+v22uv.

Now taking the sum over all edges uvE(Υ) of graph Υ, we obtain uvE(Υ)2uvu2+v2uvE(Υ)1 uvE(Υ)u2+v22uv, implies, (18)GQ(Υ)mQG(Υ).

Hence, by combining Eq. (16) (17) and (18), we have the required result. ◻

The following corollary is straightaway from the above theorem.

Corollary 3.3. Let us consider a r-regular graph Υ with m edges. Then we have GQ(Υ)=QG(Υ)=m.

3.2. In terms of degree sequence and size

In this part, we discuss the bounds of GQ and QG indices in terms of degree sequence and size of a graph.

Theorem 3.4. Let Υ be a simple, connected and undirected graph with size m, order n and degree sequence {1,2,,n}, where 12n. If it has p number of vertices of degree n, and q number of edges in the subgraph Γ induced by p vertices, then

(i) q+(pn2q)2nnpn2+12+(mpn+q)np1GQ(Υ)q+(pn2q)2n1n2+np2+(mpn+q)1np.

(ii) q+(pn2q)n2+np22n1+(mpn+q)np1QG(Υ)q+(pn2q)n2+122nnp+(mpn+q)1np. Moreover, these bounds are tight.

Proof. We prove this theorem by considering the following three cases for an  edge uvE(Υ).

Case 1. If uvE(Γ), then we have u2+v2=2n,1u2+v2=12n,2uv=2n and 12uv=12n.

Case 2. If uvE(ΥV(Γ)), then

2npu2+v221,1211u2+v212np,2np2uv21 and 12112uv12np.

Case 3. If uvE(Υ) with uV(Γ) and vV(Υ)V(Γ) or vV(Γ) and uV(Υ)V(Γ) then n2+np2u2+v2n2+12,2nnp2uv2n1,1n2+121u2+v21n2+np2 and 12n112uv12nnp.

Since |E(Γ)|=q, it follows that the number of edges from V(Γ) to V(Υ)V(Γ) is pn2q and |E(ΥV(Γ))|=mpn+q. Now from Cases 1-3, we obtain

(i) GQ(Υ)=uvE(Υ)2uvu2+v2,q2n2n+(pn2q)2n1n2+np2+(mnp+q)212np,=q+(pn2q)2n1n2+np2+(mnp+q)1np, and GQ(Υ)=uvE(Υ)2uvu2+v2,q2n2n+(pn2q)2nnpn2+12+(mnp+q)2np21,=q+(pn2q)2nnpn2+12+(mnp+q)np1.

(ii) QG(Υ)=uvE(Υ)u2+v22uv,q2n2n+(pn2q)n2+122nnp+(mnp+q)212np,=q+(pn2q)n2+122nnp+(mnp+q)1np, and QG(Υ)=uvE(Υ)u2+v22uv,q2n2n+(pn2q)n2+np22n1+(mnp+q)2np21,=q+(pn2q)n2+np22n1+(mnp+q)np1. ◻

Next, we present another version of Theorem 3.4.

Theorem 3.5. Let Υ be a connected graph of order n and size m with degree sequence (1,2,,n), where 12n. Let p be the number of vertices of degree 1, and q be the size of the subgraph induced by these p vertices. Then

(i) q+(p12q)21n12+p+12+(mp1+q)np+1GQ(Υ)q+(p12q)21p+112+n2+(mp1+q)p+1n.

(ii) q+(p12q)12+n221p+1+(mp1+q)np+1QG(Υ)q+(p12q)12+n22n1+(mp1+q)p+1n.

Moreover, these bounds are tight.

We take the following example to see the tightness of the lower and upper bounds for non-regular graphs.

Example 3.6. [8] Let Υ be a path graph Pn for n3. Then GQ(Pn)=n3+45 and QG(Pn)=n3+5. It is straightforward that both lower and upper bounds for the GQ and QG indices in Theorems 3.4 and 3.5 are the same for the GQ and QG indices of the path graph.

Keeping in mind the idea of Example 3.6, the above result can be generalized as follows:

Corollary 3.7. Let Υ be a graph and u is either Δ or δ for any vertex u. Then

(i) GQ(Υ)=mpδ+(pδ2q)2δΔδ2+Δ2.

(ii) QG(Υ)=mpδ+(pδ2q)δ2+Δ22δΔ.

3.3. In terms of the first Zagreb index

This section deals with the upper and lower bounds of GQ and QG indices in terms of the first Zagreb index, size, maximum and minimum degrees of graph Υ. The following lemma is required in order to prove the upper bound of GQ and QG indices in Theorems 3.9 and 3.15.

Lemma 3.8. ([40]) Let Υ be a graph having minimum degree δ and maximum degree Δ, and for an edge uvE(Υ) with end vertex degrees u and v, the following inequality holds: u2+v2u2+v2+δ24δ228Δ2+δ2+42Δ.

Theorem 3.9. Let Υ be a connected graph of size m. Then

(i) δ2Δ2M1(Υ)GQ(Υ)Δ2δ2M1(Υ)Δm22δmΔ228Δ2+δ2+8Δ.

(ii) 12ΔM1(Υ)QG(Υ)12δM1(Υ)δm22mδ228Δ2+δ2+8Δ.

Moreover, the equality holds when Υ is a regular graphs.

Proof. (i) From Eq. (13), using Lemma 3.8 and Eq. (1), we have GQ(Υ)=uvE(Υ)2uvu2+v2=uvE(Υ)2uvu2+v2u2+v2Δ2δ2uvE(Υ)u2+v2Δ2δ2uvE(Υ)[u2+v2+δ24δ228Δ2+δ2+42Δ]Δ2δ2uvE(Υ)[u+vδ2δ228Δ2+δ2+42Δ]=Δ2δ2M1(Υ)mΔ22δmΔ228Δ2+δ2+8Δ. Now,using the fact x2+y22x+y2, x,yR+ and Eq. (1), we have GQ(Υ)=uvE(Υ)2uvu2+v2=uvE(Υ)2uvu2+v2u2+v2u2+v2δ2Δ2uvE(Υ)u2+v2δ2Δ2uvE(Υ)(u+v)2=δ2Δ2M1(Υ).

(ii) From Eq. (14), using Lemma 3.8 and Eq. (1), we have QG(Υ)=uvE(Υ)u2+v22uv12δuvE(Υ)[u2+v2+δ24δ228Δ2+δ2+42Δ]12δuvE(Υ)[u+vδ2δ228Δ2+δ2+42Δ]=12δM1(Υ)m22mδ228Δ2+δ2+8Δ. Now, using the fact x2+y22x+y2, x,yR+ and Eq. (1), we have QG(Υ)=uvE(Υ)u2+v22uv12ΔuvE(Υ)u2+v212ΔuvE(Υ)(u+v)2=12ΔM1(Υ). ◻

3.4. In terms of the second Zagreb index

This section includes the upper and lower bounds of GQ and QG indices in terms of the second Zagreb index, size, and the maximum and minimum degree of graph Υ.

Theorem 3.10. Let Υ be a connected graph of size m. Then 1Δ2M2(Υ)GQ(Υ)mQG(Υ)1δ2M2(Υ).

Moreover, the upper and lower bounds are achievable for regular graphs.

Proof. From Eq. (14) and using Eq. (2), we obtain QG(Υ)=uvE(Υ)u2+v22uv=uvE(Υ)u2+v2u2v2uv2uv=uvE(Υ)(1u2+1v2)uv2uvuvE(Υ)(1δ2+1δ2)uv2δ=1δ2M2(Υ). Also from Eq. (13) and using Eq. (2), we have GQ(Υ)=uvE(Υ)2uvu2+v2=uvE(Υ)2uv(u2+v2)uv22Δ2uvE(Υ)uv=1Δ2M2(Υ). Also, from Theorem 3.2 we know that GQ(Υ)mQG(Υ), hence we have the required result. ◻

3.5. In terms of the forgotten topological index

In this segment, we present the mathematical relation of GQ and QG indices in terms of the forgotten index, size, and the maximum and minimum degree of graph Υ.

Theorem 3.11. Let Υ be a connected graph of size m. Then δΔF(Υ)2Δ2GQ(Υ)mQG(Υ)12δmF(Υ).

Moreover, the bounds are intense if and only if Υ is a regular graph.

Proof. From Eq. (14), using Cauchy-Schwarz inequality, i.e., (k=1nakbk)2(k=1nak2)(k=1nbk2) and Eq. (3), we get QG(Υ)=uvE(Υ)u2+v22uv(uvE(Υ)(u2+v2))(uvE(Υ)12uv)F(Υ)(uvE(Υ)12δ2)=12δmF(Υ). Now from Eq. (13) and using Eq. (3), we obtain GQ(Υ)=uvE(Υ)2uvu2+v2=uvE(Υ)2(uv+vu)u2+v2u2+v2uvE(Υ)2(Δδ+Δδ)u2+v22Δ2=δΔF(Υ)2Δ2. Also, from Theorem 3.2, we know that GQ(Υ)mQG(Υ) and hence, we have the required result. ◻

Theorem 3.12. Let Υ be a connected graph. A different upper bound of the QG index in terms of the forgotten index and minimum degree, without the size of graph Υ, is QG(Υ)12δ2F(Υ).

Moreover, the bound is attained if and only if Υ is a regular graph.

Proof. From Eq. (14) and using Eq. (3), we get QG(Υ)=uvE(Υ)u2+v22uv=uvE(Υ)u2+v22uv(u2+v2)12δ2uvE(Υ)(u2+v2)=12δ2F(Υ). ◻

3.6. In terms of the Randić index

Here, we establish the lower and upper bounds of GQ and QG indices mainly in terms of Randić index.

Theorem 3.13. Let Υ be a connected graph of size m. Then δR(Υ)GQ(Υ)mQG(Υ)ΔR(Υ).

The lower and upper bounds are achievable if and only if Υ is regular graph.

Proof. From Eq. (14) and using Eq. (4), we obtain QG(Υ)=uvE(Υ)u2+v22uvuvE(Υ)1uv2Δ22=ΔR(Υ). Also, from Eq. (13) and using Eq. (4), we obtain GQ(Υ)=uvE(Υ)2uvu2+v2=uvE(Υ)1uv2uvu2+v2=uvE(Υ)1uv2(1u2+1v2)uvE(Υ)1uv22δ2=δR(Υ). From Theorem 3.2, we know that GQ(Υ)mQG(Υ) and hence, we have the required result. ◻

3.7. In terms of the reciprocal Randić index

In this section, we prove the lower and upper bound of GQ and QG indices in terms of reciprocal Randić index, maximum and minimum degree of graph Υ.

Theorem 3.14. Let Υ be a connected graph of size m. Then RR(Υ)ΔGQ(Υ)mQG(Υ)RR(Υ)δ. Moreover, both bounds are attained for regular graph.

Proof. From Eq. (14) and using Eq. (5), we have QG(Υ)=uvE(Υ)u2+v22uv=uvE(Υ)uv2u2+v2uv=uvE(Υ)uv2(1u2+1v2)uvE(Υ)uv22δ=RR(Υ)δ. Also, from Eq. (13) and using Eq. (5), we obtain GQ(Υ)=uvE(Υ)2uvu2+v2=uvE(Υ)uv2u2+v2uvE(Υ)uv22Δ2=RR(Υ)Δ. Since Theorem 3.2 states that GQ(Υ)mQG(Υ), therefore we have the required result. ◻

3.8. In terms of the first Hyper-Zagreb index

This portion deals with the lower and upper bounds of GQ and QG indices mainly in terms of the first hyper-Zagreb index of graph Υ.

Theorem 3.15. Let Υ be a connected graph of size m. Then we have the following inequalities:

(i) δ4Δ3HM1(Υ)GQ(Υ)Δ22δ3HM1(Υ)Δm22δmΔ228 Δ2+δ2+8Δ.

(ii) 14Δ2HM1(Υ)QG(Υ)122δ2HM1(Υ)m22mδ228 Δ2+δ2+8Δ.

Moreover, the lower and upper bounds of GQ and QG indices are sharp and the equality holds when Υ is a regular graph.

Proof. (i) From Eq. (13) and using lemma 3.8 and Eq. (6), we have GQ(Υ)=uvE(Υ)2uvu2+v2=uvE(Υ)2uvu2+v2u2+v2Δ2δ2uvE(Υ)u2+v2Δ2δ2uvE(Υ)[u2+v2+δ24δ228Δ2+δ2+4Δ2]Δ2δ2uvE(Υ)[u+vδ2δ228Δ2+δ2+4Δ2]=Δ2δ2uvE(Υ)[(u+v)2u+vδ2δ228Δ2+δ2+4Δ2]=Δ22δ3HM1(Υ)mΔ22δmΔ228Δ2+δ2+8Δ. Also, using the fact x2+y22x+y2, x,yR+ and Eq. (6), we have GQ(Υ)=uvE(Υ)2uvu2+v2δ2Δ2uvE(Υ)u2+v2δ2Δ2uvE(Υ)(u+v)2=δ2Δ2uvE(Υ)(u+v)2u+vδ2Δ2uvE(Υ)(u+v)22Δ=δ4Δ3HM1(Υ).

(ii) From Eq. (14), using lemma 3.8 and Eq. (6), we have QG(Υ)=uvE(Υ)u2+v22uvuvE(Υ)u2+v22δ12δuvE(Υ)[u2+v2+δ24δ228Δ2+δ2+4Δ2]12δuvE(Υ)[u+vδ2δ228Δ2+δ2+4Δ2]=12δuvE(Υ)[(u+v)2u+vδ2δ228Δ2+δ2+4Δ2]122δ2HM1(Υ)m22mδ228Δ2+δ2+8Δ. Also, using the fact x2+y22x+y2, x,yR+ and Eq. (6), we have QG(Υ)=uvE(Υ)u2+v22uv12ΔuvE(Υ)u2+v212ΔuvE(Υ)(u+v)2=12ΔuvE(Υ)(u+v)2u+v12ΔuvE(Υ)(u+v)22Δ=14Δ2HM1(Υ). ◻

3.9. In terms of the second Hyper-Zagreb index

This section discusses about the lower and upper bound of GQ and QG indices in terms of the second hyper-Zagreb index, maximum and minimum degree of graph Υ.

Theorem 3.16. Let Υ be a connected graph of size m. Then we have the following sharp bounds of GQ and QG indices in terms of second hyper-Zagreb index, maximum and minimum degree: δΔ1Δ4HM2(Υ)GQ(Υ)mQG(Υ)1δ4HM2(Υ). The equality holds if and only if Υ is a regular graph.

Proof. From Eq. (14), using Eq. (7), we get QG(Υ)=uvE(Υ)u2+v22uv=uvE(Υ)u2v22(uv+vu)1u2v2=uvE(Υ)u2v22(1uv3+1vu3)1uvuvE(Υ)u2v222δ41δ2=1δ4HM2(Υ). Also, from Eq. (13), using Eq. (7), we have GQ(Υ)=uvE(Υ)2uvu2+v2=uvE(Υ)u2v22(uv+vu)1u2v2uvE(Υ)u2v2δΔ1Δ4=δΔ1Δ4HM2(Υ). From Theorem 3.2, we know that GQ(Υ)mQG(Υ) and hence, we have the required result. ◻

Another lower bound of QG index in terms of second hyper-Zagreb index is given as QG(Υ)1Δ4HM2(Υ).

Moreover, the bound is attained if and only if Υ is a regular graph.

Proof. From Eq. (14), using Eq. (7), we get QG(Υ)=uvE(Υ)u2+v22uv=uvE(Υ)u2v22(uv+vu)1u2v2=uvE(Υ)u2v22(1uv3+1vu3)1uvuvE(Υ)u2v222Δ41Δ2=1Δ4HM2(Υ). ◻

3.10. In terms of the symmetric division deg index

The bounds of GQ and QG indices in terms of the symmetric division deg index, maximum degree and minimum degree of graph Υ are discussed below.

Theorem 3.18. Let Υ be a connected graph of size m. Then 12(δΔ)3/2SDD(Υ)GQ(Υ)mQG(Υ)12ΔδSDD(Υ).

The bounds are equal in the case of regular graphs.

Proof. From Eq. (14), using Eq. (8), we get QG(Υ)=uvE(Υ)u2+v22uv=12uvE(Υ)(uv+vu)(uv+vu)(uv+vu)=12uvE(Υ)(uv+vu)1(uv+vu)12uvE(Υ)(uv+vu)1(δΔ+δΔ)=12ΔδSDD(Υ). Also, from Eq. (13), using Eq. (8), we have GQ(Υ)=uvE(Υ)2uvu2+v2=uvE(Υ)2(uv+vu)(uv+vu)(uv+vu)uvE(Υ)2(Δδ+Δδ)(uv+vu)(Δδ+Δδ)=12(δΔ)3/2SDD(Υ). From Theorem 3.2, we know that GQ(Υ)mQG(Υ) and hence, we have the required result. ◻

Theorem 3.19. One more lower and upper bounds of QG index in terms of the symmetric division deg index 12δΔSDD(Υ)QG(Υ)<12SDD(Υ).

The equality holds for a regular graph.

Proof. From Eq. (14), using the fact (xy+yx)<(xy+yx), x,yR+ and Eq. (8), we have QG(Υ)=uvE(Υ)u2+v22uv=12uvE(Υ)(uv+vu)<12uvE(Υ)(uv+vu)=12SDD(Υ). Also, using Eq. (8), we have QG(Υ)=uvE(Υ)u2+v22uv=12uvE(Υ)(uv+vu)(uv+vu)(uv+vu)=12uvE(Υ)(uv+vu)1(uv+vu)12uvE(Υ)(uv+vu)1(Δδ+Δδ)=12δΔSDD(Υ). ◻

3.11. In terms of the Sombor index

In this section, we provide bounds of GQ and QG indices in terms of Sombor index, maximum degree and minimum degree of graph Υ.

Theorem 3.20. Let Υ be a connected graph of size m. Then δ2Δ2SO(Υ)GQ(Υ)mQG(Υ)12δSO(Υ). The bounds are sharp and equality is attained in the case of regular graphs.

Proof. From Eq. (14), using Eq. (9), we have QG(Υ)=uvE(Υ)u2+v22uvuvE(Υ)u2+v22δ2=12δSO(Υ). Also, from Eq. (13), using Eq. (9), we obtain GQ(Υ)=uvE(Υ)2uvu2+v2=uvE(Υ)u2+v22uvu2+v2uvE(Υ)u2+v22δ2Δ2+Δ2=δ2Δ2SO(Υ). Next, Theorem 3.2 states that GQ(Υ)mQG(Υ) and therefore, we have the required result. ◻

Theorem 3.21. Let Υ be a connected graph of size m. Then the lower bound of the QG index in terms of Sombor index is QG(Υ)12ΔSO(Υ). The equality holds when Υ is a regular graph.

Proof. From Eq. (14), using Eq. (9), we have QG(Υ)=uvE(Υ)u2+v22uvuvE(Υ)u2+v22Δ2=12ΔSO(Υ). ◻

3.12. In terms of the Nirmala indices

In this section, we establish the lower and upper bounds of GQ and QG indices mainly in terms of Nirmala indices, namely, the Nirmala index, first and second inverse Nirmala index of a graph Υ.

Theorem 3.22. Let Υ be a connected graph of size m. Then the lower and upper bounds of GQ and QG indices in terms of the Nirmala index are given as 12δΔN(Υ)GQ(Υ)mQG(Υ)12ΔδN(Υ). Moreover, the bounds are tight and equality is satisfied when Υ is a regular graph.

Proof. From Eq. (14), using Eq. (10), we have QG(Υ)=uvE(Υ)u2+v22uv=12uvE(Υ)(uv+vu)u+vu+v12uvE(Υ)(Δδ+Δδ)u+v2δ=12ΔδN(Υ). Also, using Eq. (10), we have GQ(Υ)=uvE(Υ)2uvu2+v2=uvE(Υ)2(uv+vu)u+vu+vuvE(Υ)2(Δδ+Δδ)u+v2Δ=12δΔN(Υ). Further, Theorem 3.2 implies that GQ(Υ)mQG(Υ) and therefore, we have the required result. ◻

Theorem 3.23. Let Υ be a connected graph of size m. Then the lower and upper bounds of GQ and QG indices in terms of the first inverse Nirmala index are given as δ2ΔIN1(Υ)GQ(Υ)mQG(Υ)Δ2δIN1(Υ). The equality of lower and upper bounds holds if and only if Υ is a regular graph.

Proof. From Eq. (14), using Eq. (11), we have QG(Υ)=uvE(Υ)u2+v22uv=12uvE(Υ)u2+v2u+vu+vuv12uvE(Υ)2Δ2δu+vuv=Δ2δIN1(Υ). Also, from Eq. (13), using Eq. (11), we get GQ(Υ)=uvE(Υ)2uvu2+v2=uvE(Υ)2uvu2+v21u+vu+vuv=uvE(Υ)21u2+1v21u+vu+vuvuvE(Υ)21δ2+1δ212Δu+vuv=δ2ΔIN1(Υ). Further, Theorem 3.2 implies that GQ(Υ)mQG(Υ) and therefore, we have the required result. ◻

Theorem 3.24. Let Υ be a connected graph of size m. Then another lower bound of the QG index in terms of the first Nirmala index is QG(Υ)δ2IN1(Υ). The equality holds when Υ is a regular graph.

Proof. From Eq. (14), using the fact x2+y22x+y2, x,yR+ and Eq. (11), we have QG(Υ)=uvE(Υ)u2+v22uv=uvE(Υ)u2+v22uvu+vu+vuvE(Υ)u+v2u+vu+vuv=uvE(Υ)u+v2u+vuvδ2IN1(Υ). ◻

Theorem 3.25. Let Υ be a connected graph of size m. Then 2δΔIN2(Υ)GQ(Υ)mQG(Υ)2ΔδIN2(Υ). Moreover, both bounds of GQ and QG indices are attained for regular graphs.

Proof. From Eq. (14), using Eq. (12), we have QG(Υ)=uvE(Υ)u2+v22uv=12uvE(Υ)u2+v2uvuvu+vu+v=12uvE(Υ)1u2+1v2u+vuvu+v122δ22ΔuvE(Υ)uvu+v=2ΔδIN2(Υ). Also, from Eq. (13), using Eq. (12), we obtain GQ(Υ)=uvE(Υ)2uvu2+v2=uvE(Υ)2u+vu2+v2uvu+vuvE(Υ)22δ2Δ2uvu+v=2δΔIN2(Υ). Further, Theorem 3.2 states that GQ(Υ)mQG(Υ) and therefore, we have the required result. ◻

Theorem 3.26. Let Υ be a connected graph of size m. Then an alternate upper bound of the GQ index in terms of the second Nirmala index is GQ(Υ)2δIN2(Υ). The equality holds when Υ is a regular graph.

Proof. From Eq. (13), using Eq. (12), we have GQ(Υ)=uvE(Υ)2uvu2+v2=uvE(Υ)2uvu2+v2u+vu+vuvE(Υ)2u+vu+vuvu+v  (1x2+y22x+y, x,yR+)=uvE(Υ)2u+vuvu+v2δIN2(Υ). ◻

4. Conclusion

In this article, the chemical applicability and bounds of the novel degree-based GQ and QG indices are investigated. More precisely, a QSPR analysis is performed between the GQQG indices and physico-chemical properties of 22 benzenoid hydrocarbons to check the applicability of the indices. The obtained results depict that both the GQ and QG indices predict the physico-chemical properties of benzenoid hydrocarbons with the correlation coefficients R>0.9. Furthermore, we have put forward our interest to develop the mathematical relations of each of the GQ and QG indices with some well-known degree-based topological indices and some graph invariants, such as, degree sequence, size, maximum degree and minimum degree of a graph. Our performed results associated to QSPR analysis demonstrate that both the GQ and QG indices may be considered as a strong contender in the future experimentation of the chemical drugs and molecular compounds.

Acknowledgment

The authors are grateful to the reviewers for the thorough reviews of our manuscript. The valuable comments and suggestions have helped us to improve the quality of the article. Moreover, The first author (Shibsankar Das) is obliged to the Development Cell, Banaras Hindu University for financially supporting this work through the Faculty “Incentive Grant” under the Institute of Eminence (IoE) Scheme for the year 2024-25 (Project sanction order number: R/Dev/D/IoE/Incentive (Phase-IV)/2024-25/82483, dated 7 January 2025) and the second author (Virendra Kumar) is grateful to the UNIVERSITY GRANTS COMMISSION, Ministry of Human Resource Development, India for awarding the Senior Research Fellowship (SRF) with reference to UGC-Ref. No.: 1127/(CSIR-UGC NET JUNE 2019) dated 11-December-2019.

References:

  1. H. Abdo, D. Dimitrov, and I. Gutman. Graph irregularity and its measures. Applied Mathematics and Computation, 357:317–324, 2019. https://doi.org/10.1016/j.amc.2019.04.013.
  2. A. Ali, S. Elumalai, and T. Mansour. On the symmetric division deg index of molecular graphs. MATCH Communications in Mathematical and in Computer Chemistry, 83:205–220, 2020. https://match.pmf.kg.ac.rs/electronic_versions/Match83/n1/match83n1_205-220.pdf.
  3. L. E. Allem, R. O. Braga, and A. Pastine. Randić index and energy. MATCH Communications in Mathematical and in Computer Chemistry, 83(3):611–622, 2020. https://match.pmf.kg.ac.rs/electronic_versions/Match83/n3/match83n3_611-622.pdf.
  4. M. Aouchiche and V. Ganesan. Adjusting geometric-arithmetic index to estimate boiling point. MATCH Communications in Mathematical and in Computer Chemistry, 84(2):483–497, 2020. https://match.pmf.kg.ac.rs/electronic_versions/Match84/n2/match84n2_483-497.pdf.
  5. G. Arizmendi and O. Arizmendi. Energy of a graph and randić index. Linear Algebra and its Applications, 609:332–338, 2021. https://doi.org/10.1016/j.laa.2020.09.025.
  6. A. Asok and J. V. Kureethara. Characterization of the forgotten topological index and the hyper-zagreb index for the unicyclic graphs. MATCH Communications in Mathematical and in Computer Chemistry, 84(3):739–751, 2020. https://match.pmf.kg.ac.rs/electronic_versions/Match84/n3/match84n3_739-751.pdf.
  7. M. Chamua, J. Buragohain, A. Bharali, and M. E. Nazari. Predictive ability of neighborhood degree sum-based topological indices of polycyclic aromatic hydrocarbons. Journal of Molecular Structure, 1270:133904, 2022. https://doi.org/10.1016/j.molstruc.2022.133904.
  1. S. Das and V. Kumar. Investigation of closed derivation formulas for gq and qg indices of a graph via m-polynomial. Iranian Journal of Mathematical Chemistry, 13(2):129–144, 2022. https://doi.org/10.22052/ijmc.2022.246172.1614.
  2. S. Das, V. Kumar, and J. Barman. Geometric-quadratic and quadratic-geometric indices-based entropy measures of silicon carbide networks. Silicon, 17(1):75–91, 2025. https://doi.org/10.1007/s12633-024-03173-8.
  3. S. Das and S. Rai. On closed derivation formulas of nirmala indices from the m-polynomial of a graph. Journal of the Indian Chemical Society, 100(6):101017, 2023. https://doi.org/10.1016/j.jics.2023.101017.
  4. S. Das and S. Rai. M-polynomial based mathematical formulation of the (a,b)-nirmala index and its bounds. Palestine Journal of Mathematics, 13(4):1376–1389, 2024. https://pjm.ppu.edu/sites/default/files/papers/PJM_13(4)_2024_1376_to_1389.pdf.
  1. S. Das, S. Rai, and V. Kumar. On topological indices of molnupiravir and its qspr modelling with some other antiviral drugs to treat covid-19 patients. Journal of Mathematical Chemistry, 62(10):2581–2624, 2023. https://doi.org/10.1007/s10910-023-01518-z.
  2. S. Das and V. Kumar. Palestine Journal of Mathematics, 11((Special Issue II)):136–157. https://pjm.ppu.edu/paper/1035-m-polynomial-two-dimensional-silicon-carbons.
  3. S. Filipovski. New bounds for the first zagreb index. MATCH – Communications in Mathematical and in Computer Chemistry, 85(2):303–312, 2021. https://match.pmf.kg.ac.rs/electronic_versions/Match74/n1/match74n1_97-101.pdf.
  4. B. Furtula, K. C. Das, and I. Gutman. Comparative analysis of symmetric division deg index as potentially useful molecular descriptor. International Journal of Quantum Chemistry, 118(17):e25659, 2018. https://doi.org/10.1002/qua.25659.
  5. B. Furtula and I. Gutman. A forgotten topological index. Journal of Mathematical Chemistry, 53(4):1184–1190, 2015. https://doi.org/10.1007/s10910-015-0480-z.
  6. W. Gao, M. K. Jamil, and M. R. Farahani. The hyper-zagreb index and some graph operations. Journal of Applied Mathematics and Computing, 54(1):263–275, 2017. https://doi.org/10.1007/s12190-016-1008-9.
  7. I. Gutman. Geometric approach to degree-based topological indices: sombor indices. MATCH Communications in Mathematical and in Computer Chemistry, 86(1):11–16, 2021. https://match.pmf.kg.ac.rs/electronic_versions/Match86/n1/match86n1_11-16.pdf.
  8. I. Gutman and N. Trinajstić. Graph theory and molecular orbitals. In New Concepts II, pages 49–93. Springer, 2005. https://doi.org/10.1016/0009-2614(72)85099-1.
  1. B. Horoldagva and K. Das. On zagreb indices of graphs. MATCH – Communications in Mathematical and in Computer Chemistry, 85:295–301, 2021. https://match.pmf.kg.ac.rs/electronic_versions/Match85/n2/match85n2_295-301.pdf.
  2. A. Jahanbani. On the forgotten topological index of graphs. Discrete Mathematics, Algorithms and Applications, 13(5):2150054, 2021. https://doi.org/10.1142/S1793830921500543.
  3. S. Khan. Comparative study of domination parameters with the π-electronic energy of benzenoid hydrocarbons. International Journal of Quantum Chemistry, 123(20):e27192, 2023. https://doi.org/10.1002/qua.27192.
  4. V. Kulli. Nirmala index. International Journal of Mathematics Trends and Technology, 67(3):8–12, 2021. https://doi.org/10.14445/22315373/IJMTT-V67I3P502.
  5. V. Kulli. Geometric-quadratic and quadratic-geometric indices. Annals of Pure and Applied Mathematics, 25(1):1–5, 2022. http://www.researchmathsci.org/apamart/APAM-v25n1-1.pdf.
  6. V. Kulli, V. Lokesha, and K. Nirupadi. Computation of inverse nirmala indices of certain nanostructures. International Journal of Mathematical Combinatorics, 2:33–40, 2021. https://www.proquest.com/scholarly-journals/computation-inverse-nirmala-indices-certain/docview/2573887423/se-2.
  7. V. Kumar and S. Das. Comparative study between nirmala and sombor indices based on their applicability, degeneracy and smoothness. The European Physical Journal Plus, 139(11):995, 2024. https://doi.org/10.1140/epjp/s13360-024-05768-x.
  8. V. Kumar and S. Das. Comparative study of gq and qg indices as potentially favorable molecular descriptors. International Journal of Quantum Chemistry, 124(3):e27334, 2024. https://doi.org/10.1002/qua.27334.
  1. V. Kumar and S. Das. On structure sensitivity and chemical applicability of some novel degree-based topological indices. MATCH Communications in Mathematical and in Computer Chemistry, 92(1):165–203, 2024. https://doi.org/10.46793/match.92-1.165K.
  2. V. Kumar and S. Das. A novel approach to determine the sombor-type indices via m-polynomial. Journal of Applied Mathematics and Computing, 71(1):983–1007, 2025. https://doi.org/10.1007/s12190-024-02272-4.
  3. V. Kumar and S. Das. The nordhaus–gaddum-type inequalities for the nirmala indices. TWMS Journal of Applied and Engineering Mathematics, 15(1):120–136, 2025. https://jaem.isikun.edu.tr/web/images/articles/vol.15.no.1/10.pdf.
  4. X. Li, I. Gutman, and M. Randić. Mathematical Aspects of Randić-type Molecular Structure Descriptors. University of Kragujevac, Faculty of Science, 2006. https://books.google.co.in/books?id=V3MXAAAACAAJ.
  5. J. Liu, M. Matejic, E. Milovanovic, and I. Milovanovic. Some new inequalities for the forgotten topological index and coindex of graphs. MATCH Communications in Mathematical and in Computer Chemistry, 84(3):719–738, 2020. https://match.pmf.kg.ac.rs/electronic_versions/Match84/n3/match84n3_719-738.pdf.
  6. Y. Ma, S. Cao, Y. Shi, I. Gutman, M. Dehmer, and B. Furtula. From the connectivity index to various randić-type descriptors. MATCH Communications in Mathematical and in Computer Chemistry, 80(1):85–106, 2018. https://match.pmf.kg.ac.rs/electronic_versions/Match80/n1/match80n1_85-106.pdf.
  7. D. Paul, M. Arockiaraj, K. Jacob, and J. Clement. Multiplicative versus scalar multiplicative degree based descriptors in qsar/qspr studies and their comparative analysis in entropy measures. The European Physical Journal Plus, 138(4):323, 2023. https://doi.org/10.1140/epjp/s13360-023-03920-7.
  1. M. Randić. Characterization of molecular branching. Journal of the American Chemical Society, 97(23):6609–6615, 1975. https://doi.org/10.1021/ja00856a001.
  2. V. Ravi and K. Desikan. Curvilinear regression analysis of benzenoid hydrocarbons and computation of some reduced reverse degree based topological indices for hyaluronic acid-paclitaxel conjugates. Scientific Reports, 13(1):3239, 2023. https://doi.org/10.1038/s41598-023-28416-3.
  3. G. Shirdel, H. Rezapour, and A. Sayadi. The hyper-zagreb index of graph operations. Iranian Journal of Mathematical Chemistry, 4(2):213–220, 2013. https://doi.org/10.22052/ijmc.2013.5294.
  4. D. Vukićević and M. Gašperov. Bond additive modeling 1. adriatic indices. Croatica Chemica Acta, 83(3):243–260, 2010. https://www.proquest.com/scholarly-journals/bond-additive-modeling-1-adriatic-indices/docview/850838048/se-2.
  5. X. Wang, M. F. Hanif, H. Mahmood, S. Manzoor, M. K. Siddiqui, and M. Cancan. On computation of entropy measures and their statistical analysis for complex benzene systems. Polycyclic Aromatic Compounds, 43(9):7754–7768, 2023. https://doi.org/10.1080/10406638.2022.2139734.
  6. Z. Wang, Y. Mao, Y. Li, and B. Furtula. On relations between sombor and other degree-based indices. Journal of Applied Mathematics and Computing, 68:1–17, 2022. https://doi.org/10.1007/s12190-021-01516-x.
  7. D. B. West et al. Introduction to Graph Theory, volume 2. Prentice Hall, Upper Saddle River, 2001.
  8. F. Zhan, Y. Qiao, and J. Cai. Relations between the first zagreb index and spectral moment of graphs. MATCH – Communications in Mathematical and in Computer Chemistry, 81(2):383–392, 2019. https://match.pmf.kg.ac.rs/electronic_versions/Match81/n2/match81n2_383-392.pdf.