Signed (0,2)‐graphs with few eigenvalues and a symmetric spectrum

DOI10.1002/jcd.21828zbMath1529.05080arXiv2107.11556OpenAlexW4210848161MaRDI QIDQ6146191

Gary R. W. Greaves, Zoran Stanić

Publication date: 5 February 2024

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

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

zbMATH Keywords

adjacency matrixsymmetric spectrumweighing matrixbipartite doublerectagraph(folded) cubesigned \((0,2)\)-graph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Classification of small \((0,2)\)-graphs
• On strongly regular signed graphs
• Spectra of signed graphs with two eigenvalues
• On signed graphs with just two distinct adjacency eigenvalues
• Induced subgraphs of hypercubes and a proof of the sensitivity conjecture
• Integer symmetric matrices having all their eigenvalues in the interval \([ - 2,2\)]
• Matrices in the Theory of Signed Simple Graphs
• On the classification of weighing matrices and self-orthogonal codes
• Symmetric and Skew-Symmetric {0,±1}-Matrices with Large Determinants
• On sign-symmetric signed graphs
• Signed graphs with two eigenvalues and vertex degree five
• Open problems in the spectral theory of signed graphs
• A decomposition of signed graphs with two eigenvalues

This page was built for publication: Signed (0,2)‐graphs with few eigenvalues and a symmetric spectrum