English

Ramanujan graphs with diameter at most three

Combinatorics 2024-09-30 v2

Abstract

For a simple graph GG, the complement and the line graph of GG are denoted by GcG^c and L(G)L(G), respectively. In this paper, we show that for every simple connected regular graph GG with at least 55 vertices, the graph R(G):=L(L(G)c)c\mathcal{R}(G):=L(L(G)^c)^c is a Ramanujan graph with diameter at most three.

Keywords

Cite

@article{arxiv.2409.13784,
  title  = {Ramanujan graphs with diameter at most three},
  author = {Mahdi Ebrahimi},
  journal= {arXiv preprint arXiv:2409.13784},
  year   = {2024}
}
R2 v1 2026-06-28T18:51:49.857Z