References
- Aouchiche, M., Hansen, P. (2013). Two Laplacians for the distance matrix of a graph. Linear Algebra Appl. 439(1): 21–33.
- Aouchiche, M., Hansen, P. (2014). Some properties of the distance Laplacian eigenvalues of a graph. Czechoslovak Math. J. 64(139):751–761.
- Aouchiche, M., Hansen, P. (2017). Distance Laplacian eigenvalues and chromatic number in graphs. Filomat 31(9): 2545–2555.
- Cvetkovic´, D., Rowlinson, P., Simic´, S. (2010). An Introduction to the Theory of Graph Spectra. New York: Cambridge University Press.
- Das, K. C. (2007). A sharp upper bound for the number of spanning trees of a graph. Graphs Comb. 23: 625–632.
- Fernandes, R., Aguieiras, M., de Freitas, A., da Silva Jr., C. M., Del-Vecchio, R. R. (2018). Multiplicities of distance Laplacian eigenvalues and forbidden subgraphs. Linear Algebra Appl. 541: 81–93.
- Lu, L., Huang, Q., Huang, X. (2017). On graphs with distance Laplacian spectral radius of multiplicity n−3. Linear Algebra Appl. 530: 485–499.
- Ma, X., Qi, L., Tian, F., Wong, D. (2018). Graphs with some distance Laplacian eigenvalue of multiplicity n−3. Linear Algebra Appl. 557: 307–326.
- Pirzada, S. (2012). An Introduction to Graph Theory. Hyderabad, India: Universities Press.
- Pirzada, S., Khan, S. (2021). On distance Laplacian spectral radius and chromatic number of graphs. Linear Algebra Appl. 625: 44–54.
- Pirzada, S., Khan, S. (2023). On the sum of distance Laplacian eigenvalues of graphs. Tamkang J. Math. 54(1): 83–91.
- Pirzada, S., Khan, S. Distance Laplacian eigenvalues of graphs and chromatic and independence number. Revista de la Unio´n Matema´tica Argentina.