Nowadays, it is an important task to find extremal values on any molecular descriptor with respect to different graph parameters. In a molecular graph, the vertices represent the atoms and the edges represent the chemical bonds in the terms of graph theory. For one thing, the molecular graphs of some chemical compounds are unicyclic graphs or bicyclic graphs, such as benzene compounds, napthalene, cycloalkane, et al. For another, the symmetric division deg index is proven to be a potentially useful molecular descriptor in quantitative structure-property/activity relationships (QSPR/QSAR) studies recently. Therefore, we present the maximum symmetric division deg indices of unicyclic graphs and bicyclic graphs with given matching number. Furthermore, we identify the corresponding extremal graphs.
Citation: Xiaoling Sun, Yubin Gao, Jianwei Du. On symmetric division deg index of unicyclic graphs and bicyclic graphs with given matching number[J]. AIMS Mathematics, 2021, 6(8): 9020-9035. doi: 10.3934/math.2021523
Nowadays, it is an important task to find extremal values on any molecular descriptor with respect to different graph parameters. In a molecular graph, the vertices represent the atoms and the edges represent the chemical bonds in the terms of graph theory. For one thing, the molecular graphs of some chemical compounds are unicyclic graphs or bicyclic graphs, such as benzene compounds, napthalene, cycloalkane, et al. For another, the symmetric division deg index is proven to be a potentially useful molecular descriptor in quantitative structure-property/activity relationships (QSPR/QSAR) studies recently. Therefore, we present the maximum symmetric division deg indices of unicyclic graphs and bicyclic graphs with given matching number. Furthermore, we identify the corresponding extremal graphs.
| [1] | R. Todeschini, V. Consonni, Handbook of molecular descriptors, John Wiley & Sons, 2008. |
| [2] | I. Gutman, B. Furtula, Novel molecular structure descriptors–Theory and applications I, University, Faculty of Science, 2010. |
| [3] | I. Gutman, B. Furtula, Novel molecular structure descriptors–Theory and applications II, Univ. Kragujevac, Kragujevac, 2010. |
| [4] | D. Vukičević, M. Gašperov, Bond additive modeling 1. Adriatic indices, Croat. Chem. Acta., 83 (2010), 243–260. |
| [5] | A. Vasilyev, D. Vukičević, MathChem: A Python package for calculating topological indices, MATCH Commun. Math. Comput. Chem., 71 (2014), 657–680. |
| [6] |
B. Furtula, K. C. Das, I. Gutman, Comparative analysis of symmetric division deg index as potentially useful molecular descriptor, Int. J. Quantum Chem., 118 (2018), e25659. doi: 10.1002/qua.25659
|
| [7] | C. K. Gupta, V. Lokesha, S. B. Shwetha, On the symmetric division deg index of graph, Southeast Asian Bull. Math., 40 (2016), 59–80. |
| [8] | A. Ali, S. Elumalai, T. Mansour, On the symmetric division deg index of molecular graphs, MATCH Commun. Math. Comput. Chem., 83 (2020), 205–220. |
| [9] |
K. C. Das, M. Matejic, E. Milovanovic, Bounds for symmetric division deg index of graphs, Filomat, 33 (2019), 683–698. doi: 10.2298/FIL1903683D
|
| [10] | M. Ghorbani, S. Zangi, N. Amraei, New results on symmetric division deg index, J. Appl. Math. Comput., 65 (2020), 161–176. |
| [11] | C. K. Gupta, V. Lokesha, S. B. Shwetha, P. S. Ranjini, Graph operations on the symmetric division deg index of graphs, Palest. J. Math., 6 (2017), 280–286. |
| [12] | C. Liu, Y. Pan, J. Li, Tricyclic graphs with the minimum symmetric division deg index, Discrete Math. Lett., 3 (2020), 14–18. |
| [13] | J. L. Palacios, New upper bounds for the symmetric division deg index of graphs, Discrete Math. Lett., 2 (2019), 52–56. |
| [14] | Y. Pan, J. Li, Graphs that minimizing symmetric division deg index, MATCH Commun. Math. Comput. Chem., 82 (2019), 43–55. |
| [15] | A. Rajpoot, L. Selvaganesh, Bounds of the symmetric division deg index for trees and unicyclic graphs with a perfect matching, Iranian J. Math. Chem., 11 (2020), 141–159. |
| [16] | A. Vasilyev, Upper and lower bounds of symmetric division deg index, Iran. J. Math. Chem., 2 (2014), 91–98. |
| [17] | J. Liu, R. Zheng, J. Chen, B. Liu, The extremal general atom-bond connectivity indices of unicyclic and bicyclic graphs, MATCH Commun. Math. Comput. Chem., 81 (2019), 345–360. |
| [18] |
D. A. Mojdeh, M. Habibi, L. Badakhshian, Y. Rao, Zagreb indices of trees, unicyclic and bicyclic graphs with given (total) domination, IEEE Access, 7 (2019), 94143–94149. doi: 10.1109/ACCESS.2019.2927288
|
| [19] | X. Yang, L. Wang, Extremal Laplacian energy of directed trees, unicyclic digraphs and bicyclic digraphs, Appl. Math. Comput., 366 (2020), 124737. |
| [20] | J. A. Bondy, U. S. R. Murty, Graph theory with applications, London: Macmillan, 1976. |
| [21] |
A. Chang, F. Tian, On the spectral radius of unicyclic graphs with perfect matchings, Linear Algebra Appl., 370 (2003), 237–250. doi: 10.1016/S0024-3795(03)00394-X
|
| [22] |
H. Liu, X. Pan, J. Xu, On the Randić index of unicyclic conjugated molecules, J. Math. Chem., 40 (2006), 135–143. doi: 10.1007/s10910-005-9017-1
|
| [23] | A. Yu, F. Tian, On the spectral radius of unicyclic graphs, MATCH Commun. Math. Comput. Chem., 51 (2004), 97–109. |
| [24] | Y. Zhu, G. Liu, J. Wang, On the Randć index of bicyclic conjugated molecules, In: Recent results in the theory of randić index, Univ. Kragujevac, Kragujevac, 2008,133–144. |
| [25] | X. Pan, H. Liu, J. Xu, Sharp lower bounds for the general Randic index of trees with a given size of matching, MATCH Commun. Math. Comput. Chem., 54 (2005), 465–480. |
Figures(5)
Xiaoling Sun, Yubin Gao, Jianwei Du. On symmetric division deg index of unicyclic graphs and bicyclic graphs with given matching number[J]. AIMS Mathematics, 2021, 6(8): 9020-9035. doi: 10.3934/math.2021523
DownLoad: