Some regular signed graphs with only two distinct eigenvalues

DOI10.1080/03081087.2020.1736979zbMATH Open1484.05091arXiv1909.06817OpenAlexW3009061608MaRDI QIDQ5862371FDOQ5862371

Authors: Farzaneh Ramezani 

Publication date: 9 March 2022

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

Abstract: We consider signed graphs, i.e, graphs with positive or negative signs on their edges. We determine the admissible parameters for the $5,6,ldots,10$-regular signed graphs which have only two distinct eigenvalues. For each obtained parameter we provide some examples of signed graphs having two distinct eigenvalues. It turns out to construction of infinitely many signed graphs of each mentioned valency with only two distinct eigenvalues. We prove that for any $kgeq5$ there are infinitely many connected signed $k$-regular graphs having maximum eigenvalue $sqrtk$. Moreover for each $mgeq4$ we construct a signed $8$-regular graph with spectrum $[4^m,-2^{2m}]$. These yield infinite family of $k$-regular Ramanujan graphs, for each $k$.

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

Recommendations

• Constructing signed strongly regular graphs via star complement technique
• Star complements in signed graphs with two symmetric eigenvalues
• On the signed graphs with two distinct eigenvalues
• On the eigenvalues of signed complete graphs
• Star complements for \(\pm 2\) in signed graphs
• Signed graphs with two eigenvalues and vertex degree five
• On signed graphs with just two distinct adjacency eigenvalues
• Signed graphs with three eigenvalues: biregularity and beyond
• Signed graphs with totally disconnected star complements
• Signed graphs whose spectrum is bounded by \(- 2\)

zbMATH Keywords

signed graphsRamanujan graphstwo distinct eigenvalues

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Signed and weighted graphs (05C22)

Cites Work

• Signed graphs
• Eigenspaces of graphs
• Matrices in the theory of signed simple graphs
• Lifts, discrepancy and nearly optimal spectral gap
• Signed line graphs with least eigenvalue -2: the star complement technique
• Weighing matrices and their applications
• On products and line graphs of signed graphs, their eigenvalues and energy
• On signed graphs with just two distinct adjacency eigenvalues
• On the signed graphs with two distinct eigenvalues
• On unit weighing matrices with small weight
• Title not available (Why is that?)
• Induced subgraphs of hypercubes and a proof of the sensitivity conjecture
• On strongly regular signed graphs
• On a class of symmetric balanced generalized weighing matrices
• Constructing signed strongly regular graphs via star complement technique
• Open problems in the spectral theory of signed graphs

Cited In (12)

• On signed graphs with just two distinct adjacency eigenvalues
• Constructing signed strongly regular graphs via star complement technique
• Signed graphs with at most three eigenvalues
• More on signed graphs with at most three eigenvalues
• Ramanujan Signing of Regular Graphs
• On the signed graphs with two distinct eigenvalues
• Equitable partition for some Ramanujan graphs
• Induced subgraph and eigenvalues of some signed graphs
• Notes on Johnson and Hamming signed graphs
• Spectra of signed graphs with two eigenvalues
• Star complements in signed graphs with two symmetric eigenvalues
• Embedding of sign-regular signed graphs and its spectral analysis

This page was built for publication: Some regular signed graphs with only two distinct eigenvalues

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