2000 character limit reached
On adjacency and Laplacian cospectral non-isomorphic signed graphs (2205.08705v1)
Published 18 May 2022 in math.CO
Abstract: Let $\Gamma=(G,\sigma)$ be a signed graph, where $\sigma$ is the sign function on the edges of $G$. In this paper, we use the operation of partial transpose to obtain non-isomorphic Laplacian cospectral signed graphs. We will introduce two new operations on signed graphs. These operations will establish a relationship between the adjacency spectrum of one signed graph with the Laplacian spectrum of another signed graph. As an application, these new operations will be utilized to construct several pairs of cospectral non-isomorphic signed graphs. Finally, we construct integral signed graphs.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.