Back to Search
Start Over
Signed graphs cospectral with the path
- Source :
- Linear Algebra and its Applications, 553, 104-116. Elsevier Inc.
- Publication Year :
- 2018
-
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 P n , 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 .
- Subjects :
- Numerical Analysis
Algebra and Number Theory
Astrophysics::High Energy Astrophysical Phenomena
010102 general mathematics
Spectrum (functional analysis)
010103 numerical & computational mathematics
01 natural sciences
Cospectral graphs
Spectral characterization
Combinatorics
If and only if
Path (graph theory)
FOS: Mathematics
Mathematics - Combinatorics
Discrete Mathematics and Combinatorics
Path
Combinatorics (math.CO)
Geometry and Topology
0101 mathematics
Signed graph
Mathematics
Subjects
Details
- Language :
- English
- ISSN :
- 00243795
- Volume :
- 553
- Database :
- OpenAIRE
- Journal :
- Linear Algebra and its Applications
- Accession number :
- edsair.doi.dedup.....85821640bdb7a1cbba035879e5fbcb47
- Full Text :
- https://doi.org/10.1016/j.laa.2018.04.021