Papers
Topics
Authors
Recent
Search
2000 character limit reached

Cospectral graphs obtained by edge deletion

Published 8 Feb 2023 in math.CO | (2302.03854v2)

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

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.