2 papers
math.CO2024
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…
math.CO2024
Coalescing sets preserving cospectrality of graphs arising from block similarity matrices
Sajid Bin Mahamud, Steve Butler, Hannah Graff +5
Coalescing involves gluing one or more rooted graphs onto another graph. Under specific conditions, it is possible to start with cospectral graphs that are coalesced in similar way…