Signed graphs cospectral with the path

DOI10.1016/J.LAA.2018.04.021MaRDI QIDQ1642002zbMATH OpenOpenAlexWikidataFDO

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)

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

zbMATH Keywords

cospectral graphssigned graphpathspectral characterization

Mathematics Subject Classification ID

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

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$.

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

Cites work

• scientific article; zbMATH DE number 740754 (Why is no real title available?)
• scientific article; zbMATH DE number 2157777 (Why is no real title available?)
• An introduction to the theory of graph spectra
• Erratum to: T. Zaslavsky, signed graphs
• Integer symmetric matrices having all their eigenvalues in the interval \([ - 2,2]\)
• Matrices in the theory of signed simple graphs
• Spectral characterizations of signed lollipop graphs
• Spectral criterion for cycle balance in networks
• Which graphs are determined by their spectrum?

Cited in

(18)

• Open problems in the spectral theory of signed graphs
• Unbalanced signed graphs with extremal spectral radius or index
• Addendum to: ``Spectral characterizations of signed cycles
• Enumeration technique for some paths and generalized spectrum of a graph
• Constructing signed strongly regular graphs via star complement technique
• On the largest eigenvalue of signed unicyclic graphs
• The index of signed graphs with forbidden subgraphs
• Spectra of signed graphs
• Mixed paths and cycles determined by their spectrum
• scientific article; zbMATH DE number 7666851 (Why is no real title available?)
• Signed graphs with all but two eigenvalues equal to \(\pm 1\)
• Eigenpairs of a family of tridiagonal matrices: three decades later
• A switching method for constructing cospectral gain graphs
• On cospectral oriented graphs and cospectral signed graphs
• Integral signed subcubic graphs
• Spectral characterizations of signed cycles
• Unbalanced unicyclic and bicyclic graphs with extremal spectral radius.
• On cospectrality of gain 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)