A construction of cospectral signed line graphs
From MaRDI portal
Cites work
- A decomposition of signed graphs with two eigenvalues
- A note about cospectral graphs for the adjacency and normalized Laplacian matrices
- Balancedness and the least eigenvalue of Laplacian of signed graphs
- Constructing cospectral graphs
- Constructing cospectral signed graphs
- Constructing trees with given eigenvalues and angles
- Construction of cospectral graphs
- Construction of cospectral graphs, signed graphs and \(\mathbb{T}\)-gain graphs via partial transpose
- Construction of cospectral regular graphs
- Edge-signed graphs with smallest eigenvalue greater than \(-2\)
- scientific article; zbMATH DE number 3547309 (Why is no real title available?)
- scientific article; zbMATH DE number 3585485 (Why is no real title available?)
- scientific article; zbMATH DE number 3623609 (Why is no real title available?)
- scientific article; zbMATH DE number 1877038 (Why is no real title available?)
- Integer symmetric matrices having all their eigenvalues in the interval \([ - 2,2]\)
- Integral regular net-balanced signed graphs with vertex degree at most four
- Integral signed subcubic graphs
- Matrices in the theory of signed simple graphs
- On a theorem of Godsil and McKay concerning the construction of cospectral graphs
- On cospectral oriented graphs and cospectral signed graphs
- Open problems in the spectral theory of signed graphs
- Recognizing signed line graphs with a single root
- Signed line graphs with least eigenvalue -2: the star complement technique
- Spectra of signed graphs with two eigenvalues
- Total graph of a signed graph
This page was built for publication: A construction of cospectral signed line graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7323583)
