4 papers
A cospectral construction for the generalized distance matrix
Ori Friesen, Cecily Kolko, Nick Layman +3
The generalized distance matrix of a graph is a matrix in which the th entry is a function, , of the distance between vertex and vertex . Depending on the choice o…
Cospectral constructions for several graph matrices using cousin vertices
Kate Lorenzen
Graphs can be associated with a matrix according to some rule and we can find the spectrum of a graph with respect to that matrix. Two graphs are cospectral if they have the same s…
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…
Throttling positive semidefinite zero forcing propagation time on graphs
Joshua Carlson, Leslie Hogben, Jürgen Kritschgau +4
Zero forcing is a process on a graph that colors vertices blue by starting with some of the vertices blue and applying a color change rule. Throttling minimizes the sum of the size…