Ramanujan graphs with diameter at most three
Combinatorics
2024-09-30 v2
Abstract
For a simple graph , the complement and the line graph of are denoted by and , respectively. In this paper, we show that for every simple connected regular graph with at least vertices, the graph 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}
}