DocumentCode :
3216016
Title :
Explicit unique-neighbor expanders
Author :
Alon, Noga ; Capalbo, Michael
Author_Institution :
Inst. for Adv. Study, Princeton, NJ, USA
fYear :
2002
fDate :
2002
Firstpage :
73
Lastpage :
79
Abstract :
We present a simple, explicit construction of an infinite family F of bounded-degree ´unique-neighbor´ expanders Γ; i.e., there are strictly positive constants α and ε, such that all Γ = (X, E(Γ)) ∈ F satisfy the following property. For each subset S of X with no more than α|X| vertices, there are at least ε|S| vertices in X/S that are adjacent in Γ to exactly one vertex in S. The construction of F is simple to specify, and each Γ ∈ F is 6-regular. We then extend the technique and present easy to describe explicit infinite families of 4-regular and 3-regular unique-neighbor expanders, as well as explicit families of bipartite graphs with nonequal color classes and similar properties. This has several applications and settles an open problem considered by various researchers.
Keywords :
graph theory; 3-regular unique neighbor expanders; 4-regular unique neighbor expanders; bipartite graphs; bounded degree unique-neighbor expanders; explicit infinite families; explicit unique neighbor expanders; nonequal color classes; vertices; Algorithm design and analysis; Bipartite graph; Distributed algorithms; Geometry; Graph theory; Mathematics; Parallel algorithms; Routing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science, 2002. Proceedings. The 43rd Annual IEEE Symposium on
ISSN :
0272-5428
Print_ISBN :
0-7695-1822-2
Type :
conf
DOI :
10.1109/SFCS.2002.1181884
Filename :
1181884
Link To Document :
بازگشت