ISSN 2148-838Xhttps://doi.org/10.13069/jacodesmath.867532 J. Algebra Comb. Discrete Appl. 8(1) • 9–22 Received: 30 June 2020 Accepted: 9 September 2020 Journal of Algebra Combinatorics Discrete Structures and Applications Hyper-Zagreb indices of graphs and its applications Research Article Girish V. Rajasekharaiah, Usha P. Murthy Abstract: The first and second Hyper-Zagreb index of a connected graph G is defined by HM1(G) =∑ uv∈E(G)[d(u) + d(v)] 2 and HM2(G) = ∑ uv∈E(G)[d(u).d(v)] 2. In this paper, the first and sec- ond Hyper-Zagreb indices of certain graphs are computed. Also the bounds for the first and second Hyper-Zagreb indices are determined. Further linear regression analysis of the degree based indices with the boiling points of benzenoid hydrocarbons is carried out. The linear model, based on the Hyper-Zagreb index, is better than the models corresponding to the other distance based indices. 2010 MSC: 05C12, 92E10 Keywords: Degree of a vertex, Hyper-Zagreb index, Molecular graph 1. Introduction In theoretical chemistry, a molecular graph represents the topology of a molecule, by considering how the atoms are connected. This can be modeled by a graph taking vertices as atoms and edges as covalent bonds. The properties of these graph-theoretic models can be used in the study of quantitative structure– property relationship (QSPR) and quantitative structure–activity relationship (QSAR) of molecules by obtaining numerical graph invariants. Many such graph invariant indices have been studied. The oldest well known parameter is the Wiener index introduced by Harold Wiener in 1947, to study the chemical properties of paraffins [32]. For a graph theoretic terminology, we refer the books [3, 16]. Let G be a connected graph of order n and size m. Let V (G) be the vertex set and E(G) be the edge set of G. The edge joining the vertices u and v is denoted by uv. The degree of a vertex u is the number of edges incident to it and is denoted by d(u). As usual Pn,K1,n−1,Cn, Kn, and Wn denote path, star, cycle, complete graph and wheel graph on n vertices and Fn be the friendship graph with n blocks, respectively. Girish V. Rajasekharaiah (Corresponding Author); Department of Science and Humanities, PES University(EC Campus), Electronic City, Bengaluru, Karnataka, India (email: girishvr1@pes.edu, giridsi63@gmail.com). Usha P. Murthy; Department of Mathematics, Siddaganga Institute of Technology, B.H. Road, Tumakuru, Kar- nataka, India (email: ushapmurhty@yahoo.com). 9 https://orcid.org/0000-0002-0036-6542 https://orcid.org/0000-0001-9855-1887 G. V. Rajasekharaiah, U. P. Murthy / J. Algebra Comb. Discrete Appl. 8(1) (2021) 9–22 The Cartesian product G�H of two graphs G and H is the graph with vertex set V (G)×V (H) and edge set contains the edge (u,v)(u ′ ,v ′ ) if and only if u = u ′ and v and v ′ are adjacent in H or v = v ′ and u and u ′ are adjacent in G. The Wiener index W(G) of a connected graph G is defined as the sum of the distances between all pairs of vertices of G [32]. That is, W = ∑ u,v∈V (G) d(u,v),d(u,v) is the shortest distance between u and v. The Wiener index is also called as gross status [15] and total status[3]. For more about the Wiener index one can refer [4, 7, 14, 24–26, 31]. The first and second Zagreb indices of a graph G are defined as [13], M1(G) = ∑ uv∈E(G)[d(u) + d(v)] and M2(G) = ∑ uv∈E(G)[d(u).d(v)] The Zagreb indices were used in the structure property model [12, 29]. Recent results on the Zagreb indices can be found in [5, 10, 11, 19, 22, 33]. The eccentric connectivity indices of a connected graph G are defined as [1, 30] ξ1(G) = ∑ uv∈E(G)[e(u) + e(v)] and ξ2(G) = ∑ uv∈E(G)[e(u).e(v)]. Details on mathematical properties and chemical applications of eccentric connectivity indices can be found in [2, 6, 8, 9, 17, 18, 20, 21, 28, 34]. The first status connectivity index S1(G) and second status connectivity index S2(G) [27] of a connected graph G is defined as: S1(G) = ∑ uv∈E(G)[σ(u) + σ(v)] and S2(G) = ∑ uv∈E(G)[σ(u).σ(v)], where σ(u) = ∑ uv∈E(G) d(u,v). Harishchandra S. Ramane and Ashwini S. Yalnaik [27] had applied linear regression analysis of the distance based indices with the boiling points of benzenoid hydrocarbons and they have shown that it is better than any other distance based indices. Motivated by this, we applied linear regression analysis of the degree based indices with the boiling points of benzenoid hydrocarbons. The first and second Hyper-Zagreb index of a connected graph G [19] is defined by HM1(G) = ∑ uv∈E(G)[d(u) + d(v)] 2 and HM2(G) = ∑ uv∈E(G)[d(u).d(v)] 2. In this paper, the first and second Hyper-Zagreb indices of certain graphs are computed. Also the bounds for the first and second Hyper-Zagreb indices are determined. Further linear regression analysis of the degree based indices with the boiling points of benzenoid hydrocarbons is carried out. The linear model, based on the Hyper-Zagreb index, is better than the models corresponding to the other distance based indices. 2. Computation of first and second Hyper-Zagreb indices of stan- dard graphs (i) For any path Pn with n vertices, HM1(Pn) = { 4 n = 2 16p + 2 n = p + 2, p ≥ 1 HM2(Pn) = { 1 n = 2 16p−8 n = p + 2, p ≥ 1 10 G. V. Rajasekharaiah, U. P. Murthy / J. Algebra Comb. Discrete Appl. 8(1) (2021) 9–22 (ii) For any cycle Cn, HM1(Cn) = 16n=HM2(Cn). (iii) For any star graph K1,n−1, HM1(K1,n−1) = n 2(n−1) HM2(K1,n−1) = (n−1)3. (iv) For any complete graph Kn, HM1(Kn) = 2n(n−1)3 HM2(Kn) = n(n−1)5 2 . (v) For any wheel graph Wn, HM1(Wn) = (n−1)[(n + 2)2 + 62] HM2(Wn) = 9(n−1)[(n−1)2 + 32]. (vi) For any friendship graph Fn with n blocks, HM1(Fn) = 8n 3 + 16n2 + 24n. HM2(Fn) = 32n 3 + 16n. 3. Bounds for first and second Hyper-Zagreb indices Theorem 3.1. Let G be the connected graph with n vertices and m edges, then 4m ≤ HM1(G) ≤ 4m(n−1)2. Equality holds for K2. Proof. For the lower bound, since for the connected graph G, the degree of each vertex is greater than or equal 1. Hence HM1(G) ≥ ∑ uv∈E(G) [d(u) + d(v)]2 = ∑ uv∈E(G) [1 + 1]2 = ∑ uv∈E(G) 4 = 4m. For the upper bound, since for the connected graph G, the degree of each of vertex is less than or 11 G. V. Rajasekharaiah, U. P. Murthy / J. Algebra Comb. Discrete Appl. 8(1) (2021) 9–22 equal to n−1. Hence HM1(G) ≤ ∑ uv∈E(G) [d(u) + d(v)]2 = ∑ uv∈E(G) [n−1 + n−1]2 = ∑ uv∈E(G) 4(n−1)2 = 4m(n−1)2. Equality: For K2, m = 1,n = 2, the result follows from 2(i) and 2(iv). Theorem 3.2. Let G be the connected graph with n vertices and m edges, then m ≤ HM2(G) ≤ m(n−1)4. Equality holds for K2. Proof. For the lower bound, since for the connected graph G, the degree of each vertex is greater than or equal 1. Hence HM1(G) ≥ ∑ uv∈E(G) [d(u).d(v)]2 = ∑ uv∈E(G) [1.1]2 = ∑ uv∈E(G) 1 = m. For the upper bound, since for the connected graph G, the degree of each of vertex is less than or equal to n−1. Hence HM1(G) ≤ ∑ uv∈E(G) [d(u) + d(v)]2 = ∑ uv∈E(G) [(n−1)(n−1)]2 = ∑ uv∈E(G) (n−1)4 = m(n−1)4. Equality: For K2, m = 1,n = 2, the result follows from 2(i) and 2(iv). Corollary 3.3. Let G be a connected graph with n vertices, the 2n ≤ HM1(G) ≤ 2n(n−1)3 n−1 ≤ HM2(G) ≤ n(n−1)5 2 . Theorem 3.4. For the connected graph G = Pm�Pn,m,n ≥ 3, HM1(G) = 128mn−150(m + n) + 144 HM2(G) = 512mn−830(m + n) + 1236. 12 G. V. Rajasekharaiah, U. P. Murthy / J. Algebra Comb. Discrete Appl. 8(1) (2021) 9–22 Proof. Let V (G) = {(ui,vj),j = 1,2,3, . . . ,n}i=mi=1 and E(G) = A ∪ B ∪ C ∪ D, where A = {((ui,vj)(ur,vs))/(ui,vj),(ur,vs) ∈ V (G),d((ui,vj)) = 2,d((ur,vs)) = 3} with |A| = 8, B = {((ui,vj)(ur,vs))/(ui,vj),(ur,vs) ∈ V (G),d((ui,vj)) = 3,d((ur,vs)) = 3} with |B| = 2[(m−3) + (n−3)], C = {((ui,vj)(ur,vs))/(ui,vj),(ur,vs) ∈ V (G),d((ui,vj)) = 3,d((ur,vs)) = 4} with |C| = 2[(m−2)+(n−2)], D = {((ui,vj)(ur,vs))/(ui,vj),(ur,vs) ∈ V (G),d((ui,vj)) = 4,d((ur,vs)) = 4} with |D| = (m−3)(n−2)+(n−3)(m−2) such that |A|+|B|+|C|+|D| = |E(G)| = n(m−1)+(n−1)m. Case 1: The first Hyper-Zagreb index is HM1(G) = ∑ (ui,vj)(ur,vs)∈E(G)[d((ui,vj)) + d((ur,vs))] 2 . = ∑ (ui,vj)(ur,vs)∈A[d((ui,vj)) + d((ur,vs))] 2 + ∑ (ui,vj)(ur,vs)∈B[d((ui,vj)) + d((ur,vs))] 2+ ∑ (ui,vj)(ur,vs)∈C[d((ui,vj)) + d((ur,vs))] 2 + ∑ (ui,vj)(ur,vs)∈D[d((ui,vj)) + d((ur,vs))] 2. = ∑ (ui,vj)(ur,vs)∈A[2 + 3] 2 + ∑ (ui,vj)(ur,vs)∈B[3 + 3] 2 + ∑ (ui,vj)(ur,vs)∈C[3 + 4] 2+ ∑ (ui,vj)(ur,vs)∈D[4 + 4] 2. = 8.52 + 2[(m−3) + (n−3)].62 + 2[(m−2) + (n−2)].72 +[(m−3)(n−2) + (n−3)(m−2)].82. = 128mn−150(m + n) + 144. Case 2: The second Hyper-Zagreb index is HM2(G) = ∑ (ui,vj)(ur,vs)∈E(G)[d((ui,vj)).d((ur,vs))] 2 . = ∑ (ui,vj)(ur,vs)∈A[d((ui,vj)).d((ur,vs))] 2 + ∑ (ui,vj)(ur,vs)∈B[d((ui,vj)).d((ur,vs))] 2+ ∑ (ui,vj)(ur,vs)∈C[d((ui,vj)).d((ur,vs))] 2 + ∑ (ui,vj)(ur,vs)∈D[d((ui,vj)).d((ur,vs))] 2. = ∑ (ui,vj)(ur,vs)∈A[2.3] 2 + ∑ (ui,vj)(ur,vs)∈B[3.3] 2 + ∑ (ui,vj)(ur,vs)∈C[3.4] 2+ ∑ (ui,vj)(ur,vs)∈D[4.4] 2. = 8.62 + 2[(m−3) + (n−3)].92 + 2[(m−2) + (n−2)].122 +[(m−3)(n−2) + (n−3)(m−2)].162. = 512mn−830(m + n) + 1236. Theorem 3.5. For the connected graph G = Cm�Pn,m,n ≥ 3, HM1(G) = 128mn−150m 13 G. V. Rajasekharaiah, U. P. Murthy / J. Algebra Comb. Discrete Appl. 8(1) (2021) 9–22 HM2(G) = 512mn−830m. Proof. Let V (G) = {(ui,vj),j = 1,2,3, . . . ,n}i=mi=1 and E(G) = A∪B ∪C, where A = {((ui,vj)(ur,vs))/(ui,vj),(ur,vs) ∈ V (G),d((ui,vj)) = 3,d((ur,vs)) = 3} with |A| = 2(m− 1) + 2, B = {((ui,vj)(ur,vs))/(ui,vj),(ur,vs) ∈ V (G),d((ui,vj)) = 3,d((ur,vs)) = 4} with |B| = 2m, C = {((ui,vj)(ur,vs))/(ui,vj),(ur,vs) ∈ V (G),d((ui,vj)) = 4 with |C| = [(m−1)(n−2)+m(n−3)+(n−2)] such that |A|+ |B|+ |C| = |E(G)| = n(m−1) + (n−1)m + n. Case 1: The first Hyper-Zagreb index is HM1(G) = ∑ (ui,vj)(ur,vs)∈E(G)[d((ui,vj)) + d((ur,vs))] 2 . = ∑ (ui,vj)(ur,vs)∈A[d((ui,vj)) + d((ur,vs))] 2 + ∑ (ui,vj)(ur,vs)∈B[d((ui,vj))+ d((ur,vs))] 2 + ∑ (ui,vj)(ur,vs)∈C[d((ui,vj)) + d((ur,vs))] 2. = ∑ (ui,vj)(ur,vs)∈A[3 + 3] 2 + ∑ (ui,vj)(ur,vs)∈B[3 + 4] 2+ ∑ (ui,vj)(ur,vs)∈C[4 + 4] 2 = [2(m−1) + 2].62 + 2m.72 + [(m−1)(n−2) + m(n−3) + (n−2)].82 = 128mn−150m. Case 2: The second Hyper-Zagreb index is HM2(G) = ∑ (ui,vj)(ur,vs)∈E(G)[d((ui,vj)).d((ur,vs))] 2 . = ∑ (ui,vj)(ur,vs)∈A[d((ui,vj)).d((ur,vs))] 2 + ∑ (ui,vj)(ur,vs)∈B[d((ui,vj)).d((ur,vs))] 2+ ∑ (ui,vj)(ur,vs)∈C[d((ui,vj)).d((ur,vs))] 2. = ∑ (ui,vj)(ur,vs)∈A[3.3] 2 + ∑ (ui,vj)(ur,vs)∈B[3.4] 2 + ∑ (ui,vj)(ur,vs)∈C[4.4] 2+ = [2(m−1) + 2].92 + 2m.122 + [(m−1)(n−2) + m(n−3) + (n−2)].162 = 512mn−830m. Theorem 3.6. For the connected graph G = Cm�Cn, HM1(G) = 192mn−64(m + n) HM2(G) = 768mn−256(m + n). Proof. Let V (G) = {(ui,vj),j = 1,2,3, . . . ,n}i=mi=1 . For the graph G = Cm�Cn, the degree of each vertex is 4. 14 G. V. Rajasekharaiah, U. P. Murthy / J. Algebra Comb. Discrete Appl. 8(1) (2021) 9–22 Case 1: The first Hyper-Zagreb index is HM1(G) = ∑ (ui,vj)(ur,vs)∈E(G)[d((ui,vj)) + d((ur,vs))] 2 = ∑ (ui,vj)(ur,vs)∈E(G)[4 + 4] 2 = [(m−1)n + m(n−1) + mn]82 = 192mn−64(m + n). Case 2: The second Hyper-Zagreb index is HM2(G) = ∑ (ui,vj)(ur,vs)∈E(G)[d((ui,vj)) + d((ur,vs))] 2 = ∑ (ui,vj)(ur,vs)∈E(G)[4 + 4] 2 = [(m−1)n + m(n−1) + mn]162 = 768mn−256(m + n). 4. Regression model for boiling point Here we investigate the correlation between the boiling point (BP) of benzenoid hydrocarbons and the distance based indices of the corresponding molecular graphs. Experimental values of boiling points of benzenoid hydrocarbons represented in Fig.1 are taken from [23]. The scatter plot between BP and indices HM1(G),HM2(G),S1,S2,ξ1,ξ2 and W are shown in Figs. 2, 3, 4, 5, 6, 7 and 8. Figure 1. Molecular graphs of benzenoid hydrocarbons under consideration 15 G. V. Rajasekharaiah, U. P. Murthy / J. Algebra Comb. Discrete Appl. 8(1) (2021) 9–22 Figure 2. Scatter plot between the boiling point (BP) and the first Hyper-Zagreb index (HM1) Figure 3. Scatter plot between the boiling point (BP) and the second Hyper-Zagreb index (HM2) 16 G. V. Rajasekharaiah, U. P. Murthy / J. Algebra Comb. Discrete Appl. 8(1) (2021) 9–22 Figure 4. Scatter plot between the boiling point (BP) and the first status connectivity index (S1) Figure 5. Scatter plot between the boiling point (BP) and the second status connectivity index (S2) 17 G. V. Rajasekharaiah, U. P. Murthy / J. Algebra Comb. Discrete Appl. 8(1) (2021) 9–22 Figure 6. Scatter plot between the boiling point (BP) and the first eccentricity index (S2) Figure 7. Scatter plot between the boiling point (BP) and the second eccentricity index (S2) 18 G. V. Rajasekharaiah, U. P. Murthy / J. Algebra Comb. Discrete Appl. 8(1) (2021) 9–22 Figure 8. Scatter plot between the boiling point (BP) and index (W) The linear regression models for the boiling point (BP) using the data of Table 1 are obtained using the least square fitting procedure as implemented in NCSS Statistics programme. In Table 2, the model (1), shows that the correlation of the experimental boiling point of benzenoid hydrocarbons with first hyper zagreb index is better (R = 0.974) than the correlation with other distance based indices considered in this paper. The linear model (2) is also good (R = 0.945) compared to the models (4), (5), (6) and (7). 5. Conclusion For the degree based topological indices namely first and second Hyper-Zagreb index of graphs, we computed these indices for some specific graphs. Also the bounds for these indices are reported. Further a regression analysis of the boiling points of benzenoid hydrocarbons with the degree based indices have been carried out and compared the linear models. The linear model obtained, based on the status index, is better than the corresponding model based on the other distance indices. Among the distance based topological indices considered in this paper, the first Hyper-Zagreb index has good correlation with the boiling point of benzenoid hydrocarbons. 19 G. V. Rajasekharaiah, U. P. Murthy / J. Algebra Comb. Discrete Appl. 8(1) (2021) 9–22 Table 1. The values of experimental boiling points, degree and distance based indices of 21 benzenoid hydrocarbons Table 2. Correlation coefficient and standard error of the estimation 20 G. V. Rajasekharaiah, U. P. Murthy / J. Algebra Comb. Discrete Appl. 8(1) (2021) 9–22 References [1] A. R. Ashrafi, M. Ghorbani, Eccentric connectivity index of fullerenes. In: Gutman, I., Furtula, B. (eds.) Novel Molecular Structure Descriptors–Theory and Applications II, Uni. Kragujevac, Kragu- jevac (2010) 183–192. [2] A. R. Ashrafi, M. Saheli, M. Ghorbani, The eccentric connectivity index of nanotubes and nanotori, J. Comput. Appl. Math. 235 (2011) 4561–4566 [3] F. Buckley, F. Harary, Distance in Graphs, Addison-Wesley, New York (1990) [4] K. C. Das, I. Gutman, Estimating the Wiener index by means of number of vertices, number of edges and diameter, MATCH Commun. Math. Comput. Chem. 64 (2010) 647–660. [5] K. C. Das, K. Xu, J. Nam, Zagreb indices of graphs, Front. Math. China 10 (2015) 567–582. [6] K. C. Das, D. Lee, A. Graovac, Some properties of the Zagreb eccentricity indices, Ars Math. Contemp. 6 (2013) 117–125. [7] A. A. Dobrynin, R. Entringer, I. Gutman, Wiener index of trees: Theory and applications, Acta Appl. Math. 66 (2001) 211–249. [8] T. Doslic, M. Saheli, Eccentric connectivity index of benzenoid graphs. In: Gutman, I., Furtula, B. (eds.) Novel Molecular Structure Descriptors–Theory and Applications II, Uni. Kragujevac, Kragu- jevac (2010) 169–183. [9] S. Gupta, M. Singh, A. K. Madan, Application of graph theory: relationship of eccentric connectivity index and Wiener’s index with anti-inflammatory activity, J. Math. Anal. Appl. 266 (2002) 259–268 . [10] I. Gutman, K. C. Das, The first Zagreb index 30 years after, MATCH Commun. Math. Comput. Chem. 50 (2004) 83–92. [11] I. Gutman, B. Furtula, Z. Kovijani c Vukicevi, G. Popivoda, On Zagreb indices and coindices, MATCH Commun. Math. Comput. Chem. 74 (2015) 5–16. [12] I. Gutman, B. Ruscic, N. Trinajstic, C. F. Wilcox, Graph theory and molecular orbitals, XII, acyclic polyenes, J. Chem. Phys. 62 (1975) 3399–3405. [13] I. Gutman, N. Trinajstic, Graph theory and molecular orbitals, Total Pi-electron energy of alternant hydrocarbons, Chem. Phys. Lett. 17 (1972) 535–538. [14] I. Gutman, Y. Yeh, S. Lee, Y. Luo, Some recent results in the theory of the Wiener number, Indian J. Chem. 32A (1993) 651–661. [15] F. Harary, Status and contrastatus, Sociometry 22 (1959) 23–43. [16] F. Harary, Graph Theory, Narosa Publishing House, New Delhi (1999) [17] H. Hua, K. C. Das, The relationship between the eccentric connectivity index and Zagreb indices, Discrete Appl. Math. 161 (2013) 2480–2491. [18] A. Ilic, I. Gutman, Eccentric connectivity index of chemical trees, MATCH Commun. Math. Comput. Chem. 65 (2011) 731–744. [19] M. H. Khalifeh, H. Yousefi-Azari, Ashrafi, The first and second Zagreb indices of some graph oper- ations, Discrete Appl. Math. 157 (2009) 804–811. [20] V. Kumar, S. Sardana, A. K. Madan, Predicting anti-HIV activity of 2,3-diaryl-1, 3 thiazolidin-4- ones: Computational approach using reformed eccentric connectivity index, J. Mol. Model 10 (2004) 399–407. [21] M. J. Morgan, S. Mukwembi, H. C. Swart, On the eccentric connectivity index of a graph, Discrete Math. 311 (2011) 1229–1234. [22] S. Nikolic, G. Kovacevic, A. Milicevic, N. Trinajstic, The Zagreb indices 30 years after, Croat. Chem. Acta 76 (2003) 113–124. [23] S. Nikolic, A. Milicevic, N. Trinajstic, A. Juric, On use of the variable Zagreb vM2 index in QSPR: boiling points of benzenoid hydrocarbons, Molecules, 9 (2004) 1208–1221. [24] S. Nikolic, N. Trinajstic, Z. Mihalic, The Wiener index: Development and applications, Croat. Chem. Acta 68 (1995) 105–129. [25] H. S. Ramane, V. V. Manjalapur, Note on the bounds on Wiener number of a graph, MATCH 21 http://match.pmf.kg.ac.rs/mcm9.html http://match.pmf.kg.ac.rs/mcm9.html http://match.pmf.kg.ac.rs/mcm9.html https://doi.org/10.1016/j.cam.2010.03.001 https://doi.org/10.1016/j.cam.2010.03.001 https://link.springer.com/chapter/10.1007/978-0-8176-4789-6_3 https://www.semanticscholar.org/paper/Estimating-the-Wiener-Index-by-Means-of-Number-of-Das-Gutman/20e5ab0acf625987527567996da87134797ce258?p2df https://www.semanticscholar.org/paper/Estimating-the-Wiener-Index-by-Means-of-Number-of-Das-Gutman/20e5ab0acf625987527567996da87134797ce258?p2df https://doi.org/10.1007/s11464-015-0431-9 https://doi.org/10.26493/1855-3974.237.48a https://doi.org/10.26493/1855-3974.237.48a https://doi.org/10.1023/A:1010767517079 https://doi.org/10.1023/A:1010767517079 http://match.pmf.kg.ac.rs/mcm9.html http://match.pmf.kg.ac.rs/mcm9.html http://match.pmf.kg.ac.rs/mcm9.html https://doi.org/10.1006/jmaa.2000.7243 https://doi.org/10.1006/jmaa.2000.7243 https://doi.org/10.1006/jmaa.2000.7243 http://match.pmf.kg.ac.rs/electronic_versions/Match50/match50_83-92.pdf http://match.pmf.kg.ac.rs/electronic_versions/Match50/match50_83-92.pdf http://match.pmf.kg.ac.rs/electronic_versions/Match74/n1/match74n1_5-16.pdf http://match.pmf.kg.ac.rs/electronic_versions/Match74/n1/match74n1_5-16.pdf https://doi.org/10.1063/1.430994 https://doi.org/10.1063/1.430994 https://doi.org/10.1016/0009-2614(72)85099-1 https://doi.org/10.1016/0009-2614(72)85099-1 http://nopr.niscair.res.in/handle/123456789/43956 http://nopr.niscair.res.in/handle/123456789/43956 https://doi.org/10.2307/2785610 http://www.narosa.com/books_display.asp?catgcode=978-81-85015-55-2 http://dx.doi.org/10.1016/j.dam.2013.05.034 http://dx.doi.org/10.1016/j.dam.2013.05.034 http://match.pmf.kg.ac.rs/electronic_versions/Match65/n3/match65n3_731-744.pdf http://match.pmf.kg.ac.rs/electronic_versions/Match65/n3/match65n3_731-744.pdf http://dx.doi.org/10.1016/j.dam.2008.06.015 http://dx.doi.org/10.1016/j.dam.2008.06.015 https://doi.org/10.1007/s00894-004-0215-8 https://doi.org/10.1007/s00894-004-0215-8 https://doi.org/10.1007/s00894-004-0215-8 http://dx.doi.org/10.1016/j.disc.2009.12.013 http://dx.doi.org/10.1016/j.disc.2009.12.013 http://fulir.irb.hr/751/1/CCA_76_2003_113_124_nikolic.pdf http://fulir.irb.hr/751/1/CCA_76_2003_113_124_nikolic.pdf https://dx.doi.org/10.3390%2F91201208 https://dx.doi.org/10.3390%2F91201208 https://hrcak.srce.hr/176550 https://hrcak.srce.hr/176550 http://match.pmf.kg.ac.rs/electronic_versions/Match76/n1/match76n1_19-22.pdf http://match.pmf.kg.ac.rs/electronic_versions/Match76/n1/match76n1_19-22.pdf G. V. Rajasekharaiah, U. P. Murthy / J. Algebra Comb. Discrete Appl. 8(1) (2021) 9–22 Commun. Math. Comput. Chem. 76 (2016) 19–22. [26] H. S. Ramane, D. S. Revankar, A. B. Ganagi, On the Wiener index of a graph, J. Indones. Math. Soc. 18 (2012) 57–66. [27] H. S. Ramane, A. S. Yalnaik, Status connectivity indices of graphs and its applications to the boiling point of benzenoid hydrocarbons, Journal of Applied Mathematics and Computing 55 (2017) 609– 627. [28] S. Sardana, A. K. Madan, Application of graph theory: Relationship of molecular connectivity index, Wiener’s index and eccentric connectivity index with diuretic activity, MATCH Commun. Math. Comput. Chem. 43 (2001) 85–98. [29] R. Todeschini, Consonni, Handbook of Molecular Descriptors, Wiley, Weinheim (2000). [30] D. Vukicevic, A. Graovac, Note on the comparison of the first and second normalized Zagreb eccen- tricity indices, Acta Chim. Slov. 57 (2010) 524–528. [31] H. B. Walikar, V. S. Shigehalli, H. S. Ramane, Bounds on the Wiener number of a graph, MATCH Commun. Math. Comput. Chem. 50 (2004) 117–132. [32] H. Wiener, Structural determination of paraffin boiling point, J. Am. Chem. Soc. 69 (1947) 17–20. [33] B. Zhou, I. Gutman, Further properties of Zagreb indices, MATCH Commun. Math. Comput. Chem. 54 (2005) 233–239. [34] B. Zhou, Z. Du, On eccentric connectivity index, MATCH Commun. Math. Comput. Chem. 63 (2010) 181–198. 22 http://match.pmf.kg.ac.rs/electronic_versions/Match76/n1/match76n1_19-22.pdf http://match.pmf.kg.ac.rs/electronic_versions/Match76/n1/match76n1_19-22.pdf http://dx.doi.org/10.22342/jims.18.1.110.57-66 http://dx.doi.org/10.22342/jims.18.1.110.57-66 https://doi.org/10.1007/s12190-016-1052-5 https://doi.org/10.1007/s12190-016-1052-5 https://doi.org/10.1007/s12190-016-1052-5 http://match.pmf.kg.ac.rs/electronic_versions/Match43/match43_85-98.pdf http://match.pmf.kg.ac.rs/electronic_versions/Match43/match43_85-98.pdf http://match.pmf.kg.ac.rs/electronic_versions/Match43/match43_85-98.pdf https://onlinelibrary.wiley.com/doi/book/10.1002/9783527613106 http://europepmc.org/article/med/24061796 http://europepmc.org/article/med/24061796 http://match.pmf.kg.ac.rs/electronic_versions/Match50/match50_117-132.pdf http://match.pmf.kg.ac.rs/electronic_versions/Match50/match50_117-132.pdf https://doi.org/10.1021/ja01193a005 http://match.pmf.kg.ac.rs/electronic_versions/Match54/n1/match54n1_233-239.pdf http://match.pmf.kg.ac.rs/electronic_versions/Match54/n1/match54n1_233-239.pdf http://match.pmf.kg.ac.rs/electronic_versions/Match63/n1/match63n1_181-198.pdf http://match.pmf.kg.ac.rs/electronic_versions/Match63/n1/match63n1_181-198.pdf Introduction Computation of first and second Hyper-Zagreb indices of standard graphs Bounds for first and second Hyper-Zagreb indices Regression model for boiling point Conclusion References