pith. sign in

arxiv: 1709.09853 · v2 · pith:PDGQT4C4new · submitted 2017-09-28 · 🧮 math.CO

Signed graphs cospectral with the path

classification 🧮 math.CO
keywords signedgammagraphspectrumdeterminedpathcospectralequiv
0
0 comments X
read the original abstract

A signed graph $\Gamma$ is said to be determined by its spectrum if every signed graph with the same spectrum as $\Gamma$ is switching isomorphic with $\Gamma$. Here it is proved that the path $P_n$, interpreted as a signed graph, is determined by its spectrum if and only if $n\equiv 0, 1$, or 2 (mod 4), unless $n\in\{8, 13, 14, 17, 29\}$, or $n=3$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.