Ramanujan graphs with diameter at most three
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 R(G):=L(L(G)c)c is a Ramanujan graph with diameter at most three.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.