Unformatted text preview: c &gt; 0, there exists a constant d &gt; 0 and n &gt; 0 such that an ( n,d,c )-edge expander graph exits for all d d and n n .) Problem 4 . Let G be a d-regular graph and let 1 2 n be the eigenvalues as mentioned in the lecture note. Show the following: 1 = d and the corresponding eigenvector is x 1 = ( 1 / n ) T = (1 / n,. .., 1 / n ) T The graph is connected i 1 &gt; 2 The graph is bipartite i 1 =- n 1...
View Full Document
- Spring '08
- Linear Programming Relaxation, English-language films, Expander graph