Signed graphs cospectral with the path
Combinatorics
2018-05-11 v2
Abstract
A signed graph is said to be determined by its spectrum if every signed graph with the same spectrum as is switching isomorphic with . Here it is proved that the path , interpreted as a signed graph, is determined by its spectrum if and only if , or 2 (mod 4), unless , or .
Cite
@article{arxiv.1709.09853,
title = {Signed graphs cospectral with the path},
author = {Saieed Akbari and Willem H. Haemers and Hamid Reza Maimani and Leila Parsaei Majd},
journal= {arXiv preprint arXiv:1709.09853},
year = {2018}
}