The following pages link to Cubic Ramanujan graphs (Q1200273):
Displaying 34 items.
- Quantum ergodicity for quantum graphs without back-scattering (Q295517) (← links)
- Almost-Ramanujan graphs and prime gaps (Q458598) (← links)
- Corrigendum to: ``Almost-Ramanujan graphs and prime gaps'' (Q499505) (← links)
- Cubic polyhedral Ramanujan graphs with face size no larger than six (Q535313) (← links)
- New spectral lower bounds on the bisection width of graphs (Q596083) (← links)
- Upper bounds on the bisection width of 3- and 4-regular graphs (Q849636) (← links)
- A bipartite analogue of Dilworth's theorem (Q862983) (← links)
- On cycle lengths in claw-free graphs with complete closure (Q960969) (← links)
- On the spectra of certain graphs arising from finite fields (Q1273216) (← links)
- Finite fields and Ramanujan graphs (Q1362096) (← links)
- The integrity of a cubic graph (Q1827848) (← links)
- On graphs whose second largest eigenvalue does not exceed \((\sqrt {5}-1)/2\) (Q1842163) (← links)
- The Ramanujan property for regular cubical complexes (Q1847773) (← links)
- 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 (Q2043762) (← links)
- Ramanujan complexes and golden gates in \(PU(3)\) (Q2127879) (← links)
- Ramanujan graphs and expander families constructed from \(p\)-ary bent functions (Q2291671) (← links)
- Interlacing families. I: Bipartite Ramanujan graphs of all degrees (Q2352911) (← links)
- Shift lifts preserving Ramanujan property (Q2361560) (← links)
- The weight function lemma for graph pebbling (Q2410088) (← links)
- ON CONSTRUCTION OF ALMOST-RAMANUJAN GRAPHS (Q3397509) (← links)
- Ramanujan Graphs for Post-Quantum Cryptography (Q4964366) (← links)
- Quantum Chaos on Random Cayley Graphs of <i> SL 2[Z/pZ]</i> (Q5228850) (← links)
- Infinite series of quaternionic 1-vertex cube complexes, the doubling construction, and explicit cubical Ramanujan complexes (Q5237443) (← links)
- Optimal network topologies: expanders, cages, Ramanujan graphs, entangled networks and all that (Q5239301) (← links)
- Explicit Near-Ramanujan Graphs of Every Degree (Q5856148) (← links)
- The Weisfeiler-Leman algorithm and recognition of graph properties (Q5925529) (← links)
- A randomized construction of high girth regular graphs (Q6073632) (← links)
- Gap sets for the spectra of cubic graphs (Q6076648) (← links)
- Petals and books: The largest Laplacian spectral gap from 1 (Q6084713) (← links)
- A spectral bound for vertex-transitive graphs and their spanning subgraphs (Q6101140) (← links)
- The limit theorem with respect to the matrices on non-backtracking paths of a graph (Q6114966) (← links)
- Equitable partition for some Ramanujan graphs (Q6174759) (← links)
- Optimization in graphical small cancellation theory (Q6197706) (← links)
- Constructions of strongly regular Cayley graphs derived from weakly regular bent functions (Q6204333) (← links)
