2000 character limit reached
Ramanujan graphs with diameter at most three
Published 20 Sep 2024 in math.CO | (2409.13784v2)
Abstract: For a simple graph $G$, the complement and the line graph of $G$ are denoted by $Gc$ and $L(G)$, respectively. In this paper, we show that for every simple connected regular graph $G$ with at least $5$ vertices, the graph $\mathcal{R}(G):=L(L(G)c)c$ is a Ramanujan graph with diameter at most three.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.