×

On the \(A_\sigma\)-spectral radii of graphs with some given parameters. (English) Zbl 1497.05152

This paper investigates mainly the upper bound of the largest eigenvalue of the \(A_{\alpha}\)-matrix (proposed by V. Nikiforov [Appl. Anal. Discrete Math. 11, No. 1, 81–107 (2017; Zbl 1499.05384)]) of two families of graphs: \(n\)-vertex block graphs with independence number \(\alpha\) and \(n\)-vertex graphs with \(k\) cut edges.

MSC:

05C50 Graphs and linear algebra (matrices, eigenvalues, etc.)
15A18 Eigenvalues, singular values, and eigenvectors

Citations:

Zbl 1499.05384
PDFBibTeX XMLCite
Full Text: DOI Link

References:

[1] S. Akhter and R. Farooq, “Eccentric adjacency index of graphs with a given number of cut edges”, Bull. Malays. Math. Sci. Soc. 43:3 (2020), 2509-2522. · Zbl 1437.05050 · doi:10.1007/s40840-019-00820-x
[2] A. E. Brouwer and W. H. Haemers, Spectra of graphs, Springer, 2012. · Zbl 1231.05001 · doi:10.1007/978-1-4614-1939-6
[3] Y. Chen, D. Li, and J. Meng, “On the second largest \[A_\alpha \]-eigenvalues of graphs”, Linear Algebra Appl. 580 (2019), 343-358. · Zbl 1420.05099 · doi:10.1016/j.laa.2019.06.027
[4] C. M. Conde, E. Dratman, and L. N. Grippo, “On the spectral radius of block graphs with prescribed independence number \[\alpha \]”, Linear Algebra Appl. 614 (2021), 111-124. · Zbl 1459.05166 · doi:10.1016/j.laa.2020.02.003
[5] M. Desai and V. Rao, “A characterization of the smallest eigenvalue of a graph”, J. Graph Theory 18:2 (1994), 181-194. · Zbl 0792.05096 · doi:10.1002/jgt.3190180210
[6] Z. Du and B. Zhou, “On the Estrada index of graphs with given number of cut edges”, Electron. J. Linear Algebra 22 (2011), 586-592. · Zbl 1227.05179 · doi:10.13001/1081-3810.1459
[7] Z.-M. Hong and Y.-Z. Fan, “The signless Laplacian or adjacency spectral radius of bicyclic graphs with given number of cut edges”, Graphs Combin. 31:5 (2015), 1473-1485. · Zbl 1327.05207 · doi:10.1007/s00373-014-1477-2
[8] X. Huang, H. Lin, and J. Xue, “The Nordhaus-Gaddum type inequalities of \[A_\alpha \]-matrix”, Appl. Math. Comput. 365 (2020), 124716, 8. · Zbl 1433.05197 · doi:10.1016/j.amc.2019.124716
[9] S. Li and W. Sun, “An arithmetic criterion for graphs being determined by their generalized \[A_\alpha \]-spectra”, Discrete Math. 344:8 (2021), Paper No. 112469, 16. · Zbl 1466.05122 · doi:10.1016/j.disc.2021.112469
[10] S. Li and S. Wang, “The \[A_\alpha \]-spectrum of graph product”, Electron. J. Linear Algebra 35 (2019), 473-481. · Zbl 1496.05098 · doi:10.13001/1081-3810.3857
[11] S. Li and W. Wei, “The multiplicity of an \[A_\alpha \]-eigenvalue: a unified approach for mixed graphs and complex unit gain graphs”, Discrete Math. 343:8 (2020), 111916, 19. · Zbl 1441.05142 · doi:10.1016/j.disc.2020.111916
[12] S. Li, H. Zhang, and M. Zhang, “On the spectral moment of graphs with \[K\] cut edges”, Electron. J. Linear Algebra 26 (2013), 718-731. · Zbl 1282.05130 · doi:10.13001/1081-3810.1682
[13] D. Li, Y. Chen, and J. Meng, “The \[A_\alpha \]-spectral radius of trees and unicyclic graphs with given degree sequence”, Appl. Math. Comput. 363 (2019), 124622, 9. · Zbl 1433.05201 · doi:10.1016/j.amc.2019.124622
[14] H. Lin, X. Huang, and J. Xue, “A note on the \[A_\alpha \]-spectral radius of graphs”, Linear Algebra Appl. 557 (2018), 430-437. · Zbl 1396.05073 · doi:10.1016/j.laa.2018.08.008
[15] H. Liu, M. Lu, and F. Tian, “On the spectral radius of graphs with cut edges”, Linear Algebra Appl. 389 (2004), 139-145. · Zbl 1053.05080 · doi:10.1016/j.laa.2004.03.026
[16] C. M. Mynhardt and J. Raczek, “Block graphs with large paired domination multisubdivision number”, Discuss. Math. Graph Theory 41:2 (2021), 665-684. · Zbl 1458.05202 · doi:10.7151/dmgt.2230
[17] K. T. Nguyen and N. T. Hung, “The inverse connected \[p\]-median problem on block graphs under various cost functions”, Ann. Oper. Res. 292:1 (2020), 97-112. · Zbl 1451.90031 · doi:10.1007/s10479-020-03651-3
[18] V. Nikiforov, “Merging the \[A\]- and \[Q\]-spectral theories”, Appl. Anal. Discrete Math. 11:1 (2017), 81-107. · Zbl 1499.05384 · doi:10.2298/AADM1701081N
[19] V. Nikiforov and O. Rojo, “A note on the positive semidefiniteness of \[A_\alpha(G)\]”, Linear Algebra Appl. 519 (2017), 156-163. · Zbl 1357.05090 · doi:10.1016/j.laa.2016.12.042
[20] V. Nikiforov and O. Rojo, “On the \[\alpha \]-index of graphs with pendent paths”, Linear Algebra Appl. 550 (2018), 87-104. · Zbl 1385.05051 · doi:10.1016/j.laa.2018.03.036
[21] V. Nikiforov, G. Pastén, O. Rojo, and R. L. Soto, “On the \[A_\alpha \]-spectra of trees”, Linear Algebra Appl. 520 (2017), 286-305. · Zbl 1357.05089 · doi:10.1016/j.laa.2017.01.029
[22] S. Wang, D. Wong, and F. Tian, “Bounds for the largest and the smallest \[A_\alpha\] eigenvalues of a graph in terms of vertex degrees”, Linear Algebra Appl. 590 (2020), 210-223. · Zbl 1437.05151 · doi:10.1016/j.laa.2019.12.039
[23] Y. R. Wu, S. He, and J. L. Shu, “Largest spectral radius among graphs with \[k\] cut edges”, J. East China Norm. Univ. Natur. Sci. Ed. 3 (2007), 67-74.
[24] F. Xu, D. Wong, and F. Tian, “On the multiplicity of \[\alpha\] as an eigenvalue of the \[A_\alpha\] matrix of a graph in terms of the number of pendant vertices”, Linear Algebra Appl. 594 (2020), 193-204. · Zbl 1436.05067 · doi:10.1016/j.laa.2020.02.025
[25] J. Xue, H. Lin, S. Liu, and J. Shu, “On the \[A_\alpha \]-spectral radius of a graph”, Linear Algebra Appl. 550 (2018), 105-120. · Zbl 1385.05054 · doi:10.1016/j.laa.2018.03.038
[26] J. Xue, H. Lin, and J. Shu, “On the second largest distance eigenvalue of a block graph”, Linear Algebra Appl. 591 (2020), 284-298. · Zbl 1437.05156 · doi:10.1016/j.laa.2020.01.014
[27] L. You, M. Yang, W. So, and W. Xi, “On the spectrum of an equitable quotient matrix and its application”, Linear Algebra Appl. 577 (2019), 21-40. · Zbl 1418.05093 · doi:10.1016/j.laa.2019.04.013
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.