Generalized zig-zag products of regular digraphs and bounds on their spectral expansions

Publication date: 25 March 2007

Abstract: We introduce a generalization of the zig-zag product of regular digraphs (directed graphs), which allows us to construct regular digraphs with m ore flexible choices of the degrees. In our generalization, we can control the connectivity of the resulting graph measured by its spectral expansion. We derive an upper bound on the spectral expansion of the generalized zig-zag product. Our upper bound improves on known bounds when applied to the zig-zag product. We also consider a special case of the generalized zig-zag product, where one of the components is a trivial graph whose edges are all self-loops. We call it a reduced zig-zag product and derive a bound on the spectral expansion of its powers.

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

This page was built for publication: Generalized zig-zag products of regular digraphs and bounds on their spectral expansions