English

Cospectral graphs obtained by edge deletion

Combinatorics 2025-01-28 v2

Abstract

Let MNM\circ N denote the Schur product of two matrices MM and NN. A graph XX with adjacency matrix AA is walk regular if AkIA^k\circ I is a constant times II for each k0k\ge0, and XX is 1-walk-regular if it is walk regular and AkAA^k\circ A is a constant times AA for each k0k\ge0. Assume XX is 1-walk regular. Here we show that by deleting an edge in XX, or deleting edges of a graph inside a clique of XX, we obtain families of graphs that are not necessarily isomorphic, but are cospectral with respect to four types of matrices: the adjacency matrix, Laplacian matrix, unsigned Laplacian matrix, and normalized Laplacian matrix. Furthermore, we show that removing edges of Laplacian cospectral graphs in cliques of a 1-walk regular graph results in Laplacian cospectral graphs; removing edges of unsigned Laplacian cospectral graphs whose complements are also cospectral with respect to the unsigned Laplacian in cliques of a 1-walk regular graph results in unsigned Laplacian cospectral graphs.

Keywords

Cite

@article{arxiv.2302.03854,
  title  = {Cospectral graphs obtained by edge deletion},
  author = {Chris Godsil and Wanting Sun and Xiaohong Zhang},
  journal= {arXiv preprint arXiv:2302.03854},
  year   = {2025}
}
R2 v1 2026-06-28T08:34:44.609Z