The talk presents the distance Laplacian and the distance signless Laplacian matrices of graphs. The spectra of both matrices are compared to the distance spectrum. The distance Laplacian is shown to be equivalent to the combinatorial Laplacian over a large family of graphs. Similarities between n, the order of the graph, as a distance Laplacian eigenvalue, and the algebraic connectivity are established. Many other properties of the spectra of the distance Laplacian and the distance signless Laplacian are discussed.
Coffee and biscuits will be offered at the beginning of the seminar.
Welcome to everyone!