Computing bounds for the general sum-connectivity index of some graph operations. (English) Zbl 1446.05078
Summary: Let \(G\) be a graph with vertex set \(V(G)\) and edge set \(E(G)\). Denote by \(d_G(u)\) the degree of a vertex \(u\in V(G)\). The general sum-connectivity index of \(G\) is defined as \(\chi_{\alpha}(G)=\sum_{u_1u_2\in E(G)}(d_G(u_1)+d_G(u_2))^{\alpha}\), where \(\alpha\) is a real number. In this paper, we compute the bounds for general sum-connectivity index of several graph operations. These operations include corona product, Cartesian product, strong product, composition, join, disjunction and symmetric difference of graphs. We apply the obtained results to find the bounds for the general sum-connectivity index of some graphs of general interest.
Keywords:
general sum-connectivity index; Randić index; corona product; strong product; symmetric differenceReferences:
| [1] | S. Akhter, R. Farooq, S. Pirzada,Exact formulae of general sum-connectivity index for some graph operations, Matematički Vesnik,70(3), 267-282 (2018). · Zbl 1474.05057 |
| [2] | A. R. Ashrafi, T. Doslic and A. Hamzeh,The Zagreb coindices of graph operations, Discrete Appl. Math.,158, 1571-1578 (2010). · Zbl 1201.05100 |
| [3] | M. Azari,Sharp lower bounds on the Narumi-Katayama index of graph operations, Appl. Math. Comput.,239, 409-421 (2014). · Zbl 1334.05129 |
| [4] | M. Azari, A. Iranmanesh,Computing the eccentric-distance sum for graph operations, Discrete. Appl. Math.,161(18), 2827-2840 (2013). · Zbl 1287.05034 |
| [5] | M. Azari and A. Iranmanesh,Some inequalities for the multiplicative sum Zagreb index of graph operations, J. Math. Inequal.,9(3), 727-738 (2015). · Zbl 1327.05293 |
| [6] | N. De, S. M. A. Nayeem, A. Pal,F-index of some graph operations, Discrete Mathematics, Algorithms and Applications,8(2), 1650025 (2016). · Zbl 1339.05339 |
| [7] | M. Eliasi, G. Raeisi, B. Taeri, Wiener index of some graph operations, Discrete Appl. Math., 160, 1333-1344 (2012). · Zbl 1239.05051 |
| [8] | B. Eskender and E. Vumar,Eccentric connectivity index and eccentric distance sum of some graph operations, Trans. Comb.,2(1), 103-111 (2013). · Zbl 1319.05082 |
| [9] | W. Gao, M. K. Jamil, M. R. Farahani,The hyper-Zagreb index and some graph operations, J. Appl. Math. Comput.,54(1), 263-275 (2017). · Zbl 1373.05157 |
| [10] | M. H. Khalifeh, A. R. Ashrafi, H. Y. Azari,The first and second Zagreb indices of some graphs operations, Discrete Appl. Math.,157, 804-811 (2009). · Zbl 1172.05314 |
| [11] | M. H. Khalifeh, H. Y. Azari, A. R. Ashrafi,The hyper-Wiener index of graph operations, Comput. Math. Appl.,56, 1402-1407 (2008). · Zbl 1155.05316 |
| [12] | L. B. Kier, L. H. Hall,Molecular Connectivity in Chemistry and Drug Research, Acad. Press, (1976). |
| [13] | X. Li, I. Gutman,Mathematical aspects of Randić type molecular structure descriptors, Univ. Kragujevac, Kragujevac, (2006). · Zbl 1294.92032 |
| [14] | M. Randić,On characterization of molecular branching, J. Am. Chem. Soc.,97, 6609-6615 (1975). |
| [15] | B. S. Shetty, V. Lokesha, P. S. Ranjini,On the harmonic index of graph operations, Transactions on Combinatorics,4(4), 5-14 (2015). · Zbl 1463.05462 |
| [16] | M. Veylaki, M. J. Nikmehr and H. A. Tavallaee,The third and hyper-Zagreb coindices of some graph operations, J. Appl. Math. Comput.,50(1), 315-325 (2016). · Zbl 1330.05139 |
| [17] | D. Wang, S. Tan, L. Zhu,On the lower and upper bounds for different indices of tricyclic graphs, J. Appl. Math. Comput.,51, 1-11 (2016). · Zbl 1409.05078 |
| [18] | H. Wiener,Structural determination of the paraffin boiling points, J. Am. Chem. Soc.,69, 17-20 (1947). |
| [19] | B. Zhou, N. Trinajstić,On a novel connectivity index, J. Math. Chem.,46, 1252- 1270 (2009). · Zbl 1197.92060 |
| [20] | B. |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
