scientific article; zbMATH DE number 7378741
From MaRDI portal
Publication:5009641
DOI10.4230/LIPICS.ESA.2018.71zbMath1482.05084MaRDI QIDQ5009641
Michael Dinitz, Gal Shahaf, Michael Schapira
Publication date: 4 August 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Expander graphs (05C48)
Related Items (3)
Unnamed Item ⋮ A connection between a question of Bermond and Bollobás and Ramanujan graphs ⋮ Approximate Moore graphs are good expanders
Cites Work
- 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
- A note on large graphs of diameter two and given maximum degree
- Girth and Euclidean distortion
- Explicit expanding expanders
- 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
- 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
- Algebraic Graph Theory
- A VLSI decomposition of the deBruijn graph
- Expandable and Cost-Effective Network Structures for Data Centers Using Dual-Port Servers
- Computational Complexity
- 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:
