Proof for four conjectures about the distance Laplacian and distance signless Laplacian eigenvalues of a graph. (English) Zbl 1307.05151
Summary: The distance Laplacian matrix \(\mathcal{L}(G)\) of a graph \(G\) is defined to be \(\mathcal{L}(G) = \mathrm{diag}(Tr) - \mathcal{D}(G)\), where \(\mathcal{D}(G)\) denotes the distance matrix of \(G\) and \(\mathrm{diag}(Tr)\) denotes the diagonal matrix of the vertex transmissions in \(G\). Similarly, the distance signless Laplacian matrix of \(G\) is defined as \(\mathcal{Q}(G) = \mathrm{diag}(Tr) + \mathcal{D}(G)\). The eigenvalues of \(\mathcal{L}(G)\) and \(\mathcal{Q}(G)\) are called the distance Laplacian and distance signless Laplacian eigenvalues, respectively. In this paper, four conjectures proposed by M. Aouchche and P. Hansen about the largest and the second largest distance Laplacian eigenvalues and the second largest distance signless Laplacian eigenvalue of a graph are proved.
MSC:
| 05C50 | Graphs and linear algebra (matrices, eigenvalues, etc.) |
| 15A18 | Eigenvalues, singular values, and eigenvectors |
References:
| [1] | Aouchiche, M.; Hansen, P., Two Laplacians for the distance matrix of a graph, Linear Algebra Appl., 439, 21-33 (2013) · Zbl 1282.05086 |
| [2] | Aouchiche, M.; Hansen, P., Some properties of the distance Laplacian eigenvalues of a graph, Les Cahiers du GERAD, G-2013-28 |
| [3] | Xing, Rundan; Zhou, Bo, On the distance and distance signless Laplacian spectral radii of bicyclic graphs, Linear Algebra Appl., 439, 3955-3963 (2013) · Zbl 1282.05158 |
| [4] | Xing, R.; Zhou, B.; Li, J., On the distance signless Laplacian spectral radius of graphs, Linear Multilinear Algebra, 62, 1377-1387 (2014) · Zbl 1303.05122 |
| [5] | Ilić, A., Distance spectral radius of trees with given matching number, Discrete Appl. Math., 158, 1799-1806 (2010) · Zbl 1208.05018 |
| [6] | Nath, M.; Paul, S., On the distance spectral radius of bipartite graphs, Linear Algebra Appl., 436, 1285-1296 (2012) · Zbl 1236.05164 |
| [7] | Stevanović, D.; Ilić, A., Distance spectral radius of trees with fixed maximum degree, Electron. J. Linear Algebra, 20, 168-179 (2010) · Zbl 1189.05050 |
| [8] | Bose, S. S.; Nath, M.; Paul, S., On the maximal distance spectral radius of graphs without a pendent vertex, Linear Algebra Appl., 438, 4260-4278 (2013) · Zbl 1282.05096 |
| [9] | Ruzieh, S. N.; Powers, D. L., The distance spectrum of the path \(P_n\) and the first distance eigenvector of connected graphs, Linear Multilinear Algebra, 28, 75-81 (1990) · Zbl 0728.05043 |
| [10] | Yu, G., On the least distance eigenvalue of a graph, Linear Algebra Appl., 439, 8, 2428-2433 (2013) · Zbl 1282.05161 |
| [11] | Brouwer, A. E.; Haemers, W. H., Spectra of Graphs (2012), Springer: Springer New York · Zbl 1231.05001 |
| [12] | Aouchiche, M.; Hansen, P., A signless Laplacian for the distance matrix of a graph, Les Cahiers du GERAD, G-2011-78 · Zbl 1218.05087 |
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.
