Signed graphs cospectral with the path

DOI10.1016/J.LAA.2018.04.021zbMATH Open1391.05156arXiv1709.09853OpenAlexW2962980582WikidataQ129876154 ScholiaQ129876154MaRDI QIDQ1642002FDOQ1642002

Authors: S. Akbari, Willem H. Haemers, H. R. Maimani, Leila Parsaei Majd 

Publication date: 20 June 2018

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

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 $nequiv0,1$, or 2 (mod 4), unless $nin8,13,14,17,29$, or $n=3$.

Full work available at URL: https://arxiv.org/abs/1709.09853

Recommendations

• Spectral characterizations of signed cycles
• Toward a Laplacian spectral determination of signed \(\infty\)-graphs
• Spectral determination of graphs whose components are paths and cycles
• Spectral analysis of t-path signed graphs
• Spectral characterizations of signed lollipop graphs

zbMATH Keywords

cospectral graphssigned graphpathspectral characterization

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Signed and weighted graphs (05C22)

Cites Work

• Which graphs are determined by their spectrum?
• Spectral characterizations of signed lollipop graphs
• Matrices in the Theory of Signed Simple Graphs
• An introduction to the theory of graph spectra
• Title not available (Why is that?)
• Erratum to: T. Zaslavsky, signed graphs
• Title not available (Why is that?)
• Integer symmetric matrices having all their eigenvalues in the interval \([ - 2,2]\)
• Spectral criterion for cycle balance in networks

Cited In (17)

• Open problems in the spectral theory of signed graphs
• Constructing signed strongly regular graphs via star complement technique
• Unbalanced signed graphs with extremal spectral radius or index
• The index of signed graphs with forbidden subgraphs
• On the largest eigenvalue of signed unicyclic graphs
• Eigenpairs of a family of tridiagonal matrices: three decades later
• Mixed paths and cycles determined by their spectrum
• Spectral characterizations of signed cycles
• On cospectral oriented graphs and cospectral signed graphs
• On cospectrality of gain graphs
• Unbalanced unicyclic and bicyclic graphs with extremal spectral radius
• Addendum to: ``Spectral characterizations of signed cycles
• A switching method for constructing cospectral gain graphs
• Signed graphs with all but two eigenvalues equal to \(\pm 1\)
• Title not available (Why is that?)
• Spectra of signed graphs
• Integral signed subcubic graphs

This page was built for publication: Signed graphs cospectral with the path

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1642002)