Isoperimetric Inequalities for Cartesian Products of Graphs

Authors:
F. R. K. Chung;Prasad Tetali
Affiliations:
University of Pennsylvania, Philadelphia, PA 19104, USA (e-mail: chung@math.upenn.edu);School of Mathematics, Georgia Inst. of Technology, Atlanta, GA 30332–0160, USA (e-mail: tetali@math.gatech.edu)
Venue:
Combinatorics, Probability and Computing
Year:
1998

Citing 3
Cited 6

Isoperimetric numbers of graphs

Journal of Combinatorial Theory Series B
An isoperimetric inequality on the discrete torus

SIAM Journal on Discrete Mathematics
Isoperimetric Invariants For Product Markov Chains and Graph Products

Combinatorica

Expansion of product replacement graphs

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Two Counterexamples in Graph Drawing

WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Dynamic load balancing by diffusion in heterogeneous systems

Journal of Parallel and Distributed Computing
The isoperimetric constant of the random graph process

Random Structures & Algorithms
Rumor spreading and vertex expansion

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Eliminating cycles in the discrete torus

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a characterization for isoperimetric invariants, including the Cheeger constant and the isoperimetric number of a graph. This leads to an isoperimetric inequality for the Cartesian products of graphs.