The diameter of lifted digraphs.

Andrej Zlatoš · 1999

The theory of voltage assignments enables one to construct large graphs (directed as well as undirected) as covering spaces of smaller base graphs. All properties of the large graph, called the lift, are determined by the structure of the base graph and by an assignment of voltages (elements of some group) to its arcs. In this paper we prove several upper bounds on the diameter of the lift in terms of some properties of the base graph and the voltage group. 1.

Read the paper · More papers on PaperTik