| ENCYCLOPEDIA 4U .com |
Encyclopedia Home Page |
|
|
ExpanderAn expander graph is a graph with high vertex or edge expansion.Let N(S) denote the set of neighbors of S (excluding S itself). The Vertex Expansion of a graph is the minimum of |N(S)| / |S|. Let E(A,B) denote the number of edges with one extremity in A and the other in B. Let /S denote the complement of S. The Edge Expansion of a graph is the minimum E(S,/S) / |S|.
|
Content on this web site is provided for informational purposes only. We accept no responsibility for any loss, injury or inconvenience sustained by any person resulting from information published on this site. We encourage you to verify any critical information with the relevant authorities.
This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Expander".