Papers
Topics
Authors
Recent
Search
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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.