Approximate Moore graphs are good expanders (Q2284745): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jctb.2019.08.003 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2972173775 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1611.01755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NON-BACKTRACKING RANDOM WALKS MIX FASTER / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular graphs with excess one / rank
 
Normal rank
Property / cites work
 
Property / cites work: On metric Ramsey-type phenomena / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large fault-tolerant interconnection networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof of Friedman's second eigenvalue theorem and its extension to random lifts / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Graphs that do not Contain a Thomsen Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically large (\(\Delta,D\))-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A VLSI decomposition of the deBruijn graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5834367 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of a. kotzig concerning factorizations of 4‐regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The spectrum of de Bruijn and Kautz graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5009641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-Tolerant Routing in DeBruijn Comrnunication Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A connection between a question of Bermond and Bollobás and Ramanujan graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Full Length Nonlinear Shift Register Cycle Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expandable and Cost-Effective Network Structures for Data Centers Using Dual-Port Servers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Moore Graphs with Diameters 2 and 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander graphs and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral redemption in clustering sparse networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Girth and Euclidean distortion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on large graphs of diameter two and given maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Moore graphs and beyond: a survey of the degree/diameter problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the second eigenvalue of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-Tolerant Multiprocessor Link and Bus Network Architectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Minimal graphs of maximum even girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The second eigenvalue of regular graphs of given girth / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JCTB.2019.08.003 / rank
 
Normal rank

Latest revision as of 20:00, 17 December 2024

scientific article
Language Label Description Also known as
English
Approximate Moore graphs are good expanders
scientific article

    Statements

    Approximate Moore graphs are good expanders (English)
    0 references
    0 references
    0 references
    0 references
    15 January 2020
    0 references
    network design
    0 references
    spectral graph theory
    0 references
    expander graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers