Cubic Ramanujan graphs
From MaRDI portal
Publication:1200273
DOI10.1007/BF01285816zbMath0770.05062MaRDI QIDQ1200273
Publication date: 17 January 1993
Published in: Combinatorica (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items
Shift lifts preserving Ramanujan property, Quantum ergodicity for quantum graphs without back-scattering, Upper bounds on the bisection width of 3- and 4-regular graphs, Finite fields and Ramanujan graphs, A bipartite analogue of Dilworth's theorem, New spectral lower bounds on the bisection width of graphs, The weight function lemma for graph pebbling, A randomized construction of high girth regular graphs, Gap sets for the spectra of cubic graphs, Petals and books: The largest Laplacian spectral gap from 1, A spectral bound for vertex-transitive graphs and their spanning subgraphs, The limit theorem with respect to the matrices on non-backtracking paths of a graph, Equitable partition for some Ramanujan graphs, Optimization in graphical small cancellation theory, Constructions of strongly regular Cayley graphs derived from weakly regular bent functions, Almost-Ramanujan graphs and prime gaps, Corrigendum to: ``Almost-Ramanujan graphs and prime gaps, On cycle lengths in claw-free graphs with complete closure, Ramanujan graphs and expander families constructed from \(p\)-ary bent functions, An explicit infinite family of \(\mathbb{M}\)-vertex graphs with maximum degree \(K\) and diameter \([1+o(1)\log_{K-1}\mathbb{M}\) for each \(K-1\) a prime power], Ramanujan Graphs for Post-Quantum Cryptography, On the spectra of certain graphs arising from finite fields, Quantum Chaos on Random Cayley Graphs of SL 2[Z/pZ], ON CONSTRUCTION OF ALMOST-RAMANUJAN GRAPHS, The Weisfeiler-Leman algorithm and recognition of graph properties, The integrity of a cubic graph, Optimal network topologies: expanders, cages, Ramanujan graphs, entangled networks and all that, On graphs whose second largest eigenvalue does not exceed \((\sqrt {5}-1)/2\), The Ramanujan property for regular cubical complexes, Explicit Near-Ramanujan Graphs of Every Degree, Interlacing families. I: Bipartite Ramanujan graphs of all degrees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
- Ramanujan graphs
- Quaternäre quadratische Formen und die Riemannsche Vermutung für die Kongruenzzetafunktion
- Hecke operators and distributing points on the sphere I
- Trees and discrete subgroups of Lie groups over local fields
- Fibre Systems of Jacobian Varieties: (III. Fibre Systems of Elliptic Curves)
