paper

Cospectral graphs obtained by edge deletion

arXiv:2302.03854

Abstract

Let denote the Schur product of two matrices and . A graph with adjacency matrix is walk regular if is a constant times for each , and is 1-walk-regular if it is walk regular and is a constant times for each . Assume is 1-walk regular. Here we show that by deleting an edge in , or deleting edges of a graph inside a clique of , 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.

Cospectral graphs obtained by edge deletion · wovepaper