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

DOI10.1002/JCD.21828MaRDI QIDQ6146191zbMATH OpenOpenAlexFDO

Authors 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

(folded) cubeadjacency matrixbipartite doublerectagraphsigned \((0,2)\)-graphsymmetric spectrumweighing matrix

Mathematics Subject Classification ID

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

Abstract: We investigate properties of signed graphs that have few distinct eigenvalues together with a symmetric spectrum. Our main contribution is to determine all signed $(0,2)$-graphs with vertex degree at most $6$ that have precisely two distinct eigenvalues $pmlambda$. Next, we consider to what extent induced subgraphs of signed graph with two distinct eigenvalues $pmlambda$ are determined by their spectra. Lastly, we classify signed $(0,2)$-graphs that have a symmetric spectrum with three distinct eigenvalues and give a partial classification for those with four distinct eigenvalues.

Recommendations

• Spectra of signed graphs with two eigenvalues
• On signed graphs with two distinct eigenvalues
• Star complements in signed graphs with two symmetric eigenvalues
• On signed graphs with at most two eigenvalues unequal to \(\pm 1\)
• The signed graphs with two eigenvalues unequal to \(\pm 1\)

Cites work

• A decomposition of signed graphs with two eigenvalues
• An introduction to the theory of graph spectra
• Classification of small \((0,2)\)-graphs
• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 3966090 (Why is no real title available?)
• scientific article; zbMATH DE number 3697163 (Why is no real title available?)
• 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 sign-symmetric signed graphs
• On signed graphs with just two distinct adjacency eigenvalues
• On strongly regular signed graphs
• On the classification of weighing matrices and self-orthogonal codes
• Open problems in the spectral theory of signed graphs
• Signed graphs with two eigenvalues and vertex degree five
• Spectra of signed graphs with two eigenvalues
• Symmetric and Skew-Symmetric {0,±1}-Matrices with Large Determinants

Cited in

(3)

• Signed graphs with all but two eigenvalues equal to 1
• Spectra of signed graphs and related oriented graphs
• Symmetry in complex unit gain graphs and their spectra

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

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