Graphs are mathematical objects that can be represented by matrices. Two graphs are cospectral if they have the same set of eigenvalues with respect to a matrix. In this talk, we discuss constructions of cospectral graphs for the distance Laplacian matrix. Additionally, the open problem of finding cospectral mates that are trees for the distance Laplacian.
Before the talk, at 4:10pm, there will be tea and cookies in Wean 6220.
The ACO Seminar (2019–2020)