Ramanujan graphs arising as weighted Galois covering graphs

DOI10.5614/ejgta.2018.6.1.9zbMath1467.05117OpenAlexW2797741371WikidataQ130001788 ScholiaQ130001788MaRDI QIDQ5009973

Howard Skogman, Marvin Minei

Publication date: 23 August 2021

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5614/ejgta.2018.6.1.9

zbMATH Keywords

weighted graphsblock diagonalizationGalois coversgraph spectraRamanujan graphscovering graphs

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Zeta functions of finite graphs and coverings. III
• Weighted zeta functions of graph coverings
• Lifts, discrepancy and nearly optimal spectral gap
• Homomorphisms, representations and characteristic polynomials of digraphs
• Ramanujan graphs
• Generating all graph coverings by permutation voltage assignments
• Zeta functions of finite graphs and coverings. II
• Zeta functions of finite graphs and coverings
• Interlacing families. I: Bipartite Ramanujan graphs of all degrees
• Bartholdi zeta and \(L\)-functions of weighted digraphs, their coverings and products
• Harmonic Galois theory for finite graphs
• Expander graphs and their applications
• Edge transitive ramanujan graphs and symmetric LDPC good codes