English

Some regular signed graphs with only two distinct eigenvalues

Combinatorics 2019-09-17 v1

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,,10}\{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 k5k\geq 5 there are infinitely many connected signed kk-regular graphs having maximum eigenvalue k\sqrt{k}. Moreover for each m4m\geq 4 we construct a signed 88-regular graph with spectrum [4m,22m][4^m,-2^{2m}]. These yield infinite family of kk-regular Ramanujan graphs, for each kk.

Keywords

Cite

@article{arxiv.1909.06817,
  title  = {Some regular signed graphs with only two distinct eigenvalues},
  author = {Farzaneh Ramezani},
  journal= {arXiv preprint arXiv:1909.06817},
  year   = {2019}
}
R2 v1 2026-06-23T11:15:44.346Z