Isoperimetric Inequalities for Cartesian Products of Graphs

Combinatorics Probability and Computing

Volumn 7, Issue 2, 1998, Pages 141-148

  Chung, F R K ^a   Tetali, Prasad ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032400054     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548397003350     Document Type: Article

References (12)

1. Aldous, D. and Fill, J. A. Reversible Markov Chains and Random Walks on Graphs. Book in preparation.
2. Bernstein, A. J. (1967) Maximally connected arrays on the n-cube. SIAM J. Appl. Math. 15 1485-1489.
3. Bollobás, B. and Leader, I. (1991) Edge-isoperimetric inequalities in the grid. Combinatorica 11 299-314.
4. Bollobás, B. and Leader, I. (1990) An isoperimetric inequality on the discrete torus, SIAM J. Discrete Math. 3 32-37.
5. Cheeger, J. (1970) A lower bound for the smallest eigenvalue of the Laplacian. Problems in Analysis (R. C. Gunning, ed.), Princeton University Press, pages 195-199.
6. Chung, F. R. K. (1996) Spectral Graph Theory. CMBS Lecture Notes, AMS Publication.
7. Harper, L. H. (1966) Optimal numberings and isoperimetric problems on graphs. J. Combin. Theory 1 385-393.
8. Hart, S. (1976) A note on the edges of the n-cube. Discrete Math. 14 157-163.
9. Houdré, C. and Tetali, P. (1996) Isoperimetric constants for product Markov chains and graph products. Preprint.
10. Lindsey, J. H. (1964) Assignment of numbers to vertices. Amer. Math. Monthly 71 508-516.
11. Mohar, B. (1989) Isoperimetric number of graphs. J. Combin. Theory, Ser. B 47 274-291.
12. Wang, D.-L. and Wang, P. (1977) Discrete isoperimetric problems. SIAM J. Appl. Math. 32 860-870.