References
- Brouwer AE, Haemers WH. Spectra of graphs. New York: Springer Universitext; 2012.
- Nikiforov V. Merging the A- and Q-spectral theories. Appl Anal Discrete Math. 2016;11:81–107.
- Porto G, Allem LE. Eigenvalue interlacing in graphs. Proc Ser Brazilian Soc Comput Appl Math. 2017;5:1–7.
- Hall F, Patel K, Stewart M. Interlacing results on matrices associated with graphs. J Combin Math Combin Comput. 2009;68:113–127.
- Chen G, Davis G, Hall F, et al. An interlacing result on normalized Laplacians. SIAM J Discrete Math. 2004;18:353–361.
- Wang J, Belardo F. A note on the signless Laplacian eigenvalues of graphs. Linear Algebra Appl. 2011;435:2585–2590.
- Wu B, Shao J-Y, Yuan X. Deleting vertices and interlacing Laplacian eigenvalues. Chin Ann Math Ser B. 2010;31:231–236.
- Chen Y, Li D, Meng J. Nordhaus–Gaddum type inequalities of the second Aα-eigenvalue of a graph. Linear Algebra Appl. 2020;602:57–72.
- Schott JR. Matrix analysis for statistics. New York: John Wiley and Sons; 2016.
- Horn RA, Johnson CR. Matrix analysis. Cambridge: Cambridge University Press; 1985.
- Lin H, Xue J, Shu J. On the Aα-spectra of graphs. Linear Algebra Appl. 2018;556:210–219.
- Li R. The k-domination number and bounds for the Laplacian eigenvalues of graphs. Util Math. 2009;79:189–192.
- Liu H, Lu M. Bounds of signless Laplacian spectrum of graphs based on the k-domination number. Linear Algebra Appl. 2014;440:83–89.
- Bauer D, Veldman HJ, Morgana A, et al. Long cycles in graphs with large degree sums. Discrete Math. 1990;79:59–70.