Ramanujan graphs arising as weighted Galois covering graphs

Ramanujan graphs arising as weighted Galois covering graphs

<p>We give a new construction of Ramanujan graphs using a generalized type of covering graph called a weighted covering graph. For a given prime p the basic construction produces bipartite Ramanujan graphs with <span class="math">4<em>p</em></span> vertices an...

Full description

Bibliographic Details
Main Authors: Marvin Minei, Howard Skogman
Format: Article
Language:English
Published: Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 2018-04-01
Series:Electronic Journal of Graph Theory and Applications
Subjects:
ramanujan graphs, covering graphs, weighted graphs, galois covers, block diagonalization, graph spectra
Online Access:https://www.ejgta.org/index.php/ejgta/article/view/264

Internet

https://www.ejgta.org/index.php/ejgta/article/view/264

Similar Items