Connected signed graphs L-cospectral to signed ∞-graphs

DOI10.1080/03081087.2018.1494122zbMath1425.05067OpenAlexW2834485682MaRDI QIDQ5240726

Francesco Belardo, Maurizio Brunetti

Publication date: 29 October 2019

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

Full work available at URL: https://doi.org/10.1080/03081087.2018.1494122

zbMATH Keywords

Laplaciansigned graphspectral determinationbicyclic\(\infty\)-graph

Mathematics Subject Classification ID

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

Related Items

On cospectrality of gain graphs ⋮ Signed graphs with all but two eigenvalues equal to \(\pm 1\) ⋮ Inertias of Laplacian matrices of weighted signed graphs ⋮ Unbalanced unicyclic and bicyclic graphs with extremal spectral radius

Cites Work

• Unnamed Item
• The spectral characterization of \(\infty\)-graphs
• On the spectral characterizations of \(\infty \)-graphs
• Developments on spectral characterizations of graphs
• Signed graphs
• A mathematical bibliography of signed and gain graphs and allied areas
• Glossary of signed and gain graphs and allied areas
• Which graphs are determined by their spectrum?
• Signed bicyclic graphs minimizing the least Laplacian eigenvalue
• On the Laplacian coefficients of signed graphs
• Spectral characterizations of signed lollipop graphs
• Laplacian spectral characterization of roses
• Balancedness and the least eigenvalue of Laplacian of signed graphs
• On the notion of balance of a signed graph
• Signless Laplacian spectral characterization of line graphs ofT-shape trees
• Matrices in the Theory of Signed Simple Graphs
• Spectral criterion for cycle balance in networks