2 papers
math.CO2018
Graphs that are cospectral for the distance Laplacian
Boris Brimkov, Ken Duna, Leslie Hogben +4
The distance matrix of a graph is the matrix containing the pairwise distances between vertices, and the distance Laplacian matrix is $\mathcal{D}^L(G)=T(G)-\m…
math.PR2018
Condensation in preferential attachment models with location-based choice
John Haslegrave, Jonathan Jordan, Mark Yarrow
We introduce a model of a preferential attachment based random graph which extends the family of models in which condensation phenomena can occur. Each vertex has an associated uni…