scientific article; zbMATH DE number 7378741

DOI10.4230/LIPICS.ESA.2018.71MaRDI QIDQ5009641zbMATH OpenFDO

Authors Michael Dinitz, Michael Schapira, Gal Shahaf

Publication date 4 August 2021

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2018.71

zbMATH Keywords

expander graphsnetwork designspectral graph theory

Mathematics Subject Classification ID

Distance in graphs (05C12) Expander graphs (05C48) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Approximate Moore graphs are good expanders
• Large Graphs with Given Degree and Diameter—Part I
• scientific article; zbMATH DE number 4059444
• scientific article; zbMATH DE number 861410
• Expander spanning subgraphs with large girth
• Some large graphs with given degree and diameter
• Large bounded degree trees in expanding graphs
• On expander graphs and connectivity in small space
• Large graphs with given degree and diameter. II
• On expansive graphs

Cites work

• A note on large graphs of diameter two and given maximum degree
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• A VLSI decomposition of the deBruijn graph
• Algebraic Graph Theory
• Asymptotically large (\(\Delta,D\))-graphs
• Computational Complexity
• Expandable and Cost-Effective Network Structures for Data Centers Using Dual-Port Servers
• Expander graphs and their applications
• Fault-Tolerant Multiprocessor Link and Bus Network Architectures
• Fault-Tolerant Routing in DeBruijn Comrnunication Networks
• Girth and Euclidean distortion
• scientific article; zbMATH DE number 4165188 (Why is no real title available?)
• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• scientific article; zbMATH DE number 1460605 (Why is no real title available?)
• Large fault-tolerant interconnection networks
• Moore graphs and beyond: a survey of the degree/diameter problem
• NON-BACKTRACKING RANDOM WALKS MIX FASTER
• 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
• On Graphs that do not Contain a Thomsen Graph
• On Moore Graphs with Diameters 2 and 3
• Regular graphs with excess one
• Spectral redemption in clustering sparse networks
• The second eigenvalue of regular graphs of given girth

Cited in

(3)

• A connection between a question of Bermond and Bollobás and Ramanujan graphs
• Approximate Moore graphs are good expanders
• scientific article; zbMATH DE number 7650113 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5009641)