Approximate Moore graphs are good expanders
From MaRDI portal
Publication:2284745
DOI10.1016/J.JCTB.2019.08.003zbMath1430.05027arXiv1611.01755OpenAlexW2972173775MaRDI QIDQ2284745
Michael Schapira, Michael Dinitz, Gal Shahaf
Publication date: 15 January 2020
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.01755
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The second eigenvalue of regular graphs of given girth
- Large fault-tolerant interconnection networks
- Regular graphs with excess one
- On the second eigenvalue of a graph
- The spectrum of de Bruijn and Kautz graphs
- A note on large graphs of diameter two and given maximum degree
- Girth and Euclidean distortion
- A connection between a question of Bermond and Bollobás and Ramanujan graphs
- On metric Ramsey-type phenomena
- Asymptotically large (\(\Delta,D\))-graphs
- Moore graphs and beyond: a survey of the degree/diameter problem
- Spectral redemption in clustering sparse networks
- On Moore Graphs with Diameters 2 and 3
- Fault-Tolerant Multiprocessor Link and Bus Network Architectures
- A new proof of Friedman's second eigenvalue theorem and its extension to random lifts
- NON-BACKTRACKING RANDOM WALKS MIX FASTER
- Expander graphs and their applications
- Fault-Tolerant Routing in DeBruijn Comrnunication Networks
- A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
- A VLSI decomposition of the deBruijn graph
- Expandable and Cost-Effective Network Structures for Data Centers Using Dual-Port Servers
- Computational Complexity
- On Minimal graphs of maximum even girth
- On Graphs that do not Contain a Thomsen Graph
- On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers
- On a problem of a. kotzig concerning factorizations of 4‐regular graphs
This page was built for publication: Approximate Moore graphs are good expanders
