Expander graph
In graph theory, an expander graph is a sparse graph that has strong connectivity properties, quantified using vertex, edge or spectral expansion. Expander constructions have spawned research in pure and applied mathematics, with several applications to complexity theory, design of robust computer networks, and the theory of error-correcting codes.
Expander graph - Wikipedia Jump to content From Wikipedia, the free encyclopedia Sparse graph with strong connectivity In graph theory , an expander graph is a sparse graph that has strong connectivity properties, quantified using vertex , edge or spectral expansion. Expander constructions have spawned research in pure and applied mathematics, with several applications to complexity theory , design of robust computer networks , and the theory of error-correcting codes . [ 1 ] Definitions [ edit ] Intuitively, an expander graph is a finite, undirected multigraph in which every subset of the ver
related reading
- Sublinear expandersias.edu
- Exact Stability for Turan's Theoremarxiv.org
- Arborescences of Random Covering Graphsarxiv.org
- GraphTheoreticProperties.pdfcs.rice.edu
- Cover times - spectralarxiv.org
- Thatchaphol Saranurak - Graph Decompositionsites.google.com
- Matroiden.wikipedia.org
- Induced rational exponents near twoarxiv.org
- What’s up with the Graph Laplacian? – with high probabilitysamidavies.wordpress.com
- Ramsey theory and strength of graphsarxiv.org
- Ch12.pdfmath.uni-hamburg.de
- quasikernelarxiv.org