G-2013-28
Some Properties of the Distance Laplacian Eigenvalues of a Graph
et référence BibTeX
The distance Laplacian of a connected graph G is defined by L = Diag(Tr) - D, where D is the distance matrix of G , and Diag(Tr) is the diagonal matrix whose main entries are the vertex transmissions in G . The spectrum of L is called the distance Laplacian spectrum of G. In the present paper, we investigate some particular distance Laplacian eigenvalues. Among other results, we show that the complete graph is the unique graph with only two distinct distance Laplacian eigenvalues. We establish some properties of the distance Laplacian spectrum that enable us to derive the distance Laplacian characteristic polynomials for several classes of graphs.
Paru en avril 2013 , 13 pages
Axe de recherche
Applications de recherche
Publication
sept. 2014
et
Czechoslovak Mathematical Journal, 64(3), 751–761, 2014
référence BibTeX