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 Pn, interpreted as a signed graph, is determined by its spectrum if and only if n≡0,1, or 2 (mod 4), unless n∈{8,13,14,17,29}, or n=3.
| Original language | English |
|---|---|
| Pages (from-to) | 104-116 |
| Journal | Linear Algebra and its Applications |
| Volume | 553 |
| DOIs | |
| Publication status | Published - 15 Sept 2018 |
Keywords
- Cospectral graphs
- Path
- Signed graph
- Spectral characterization
Fingerprint
Dive into the research topics of 'Signed graphs cospectral with the path'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver