Published in

Elsevier, Discrete Mathematics, 1-3(244), p. 137-152, 2002

DOI: 10.1016/s0012-365x(01)00064-4

Links

Tools

Export citation

Search in Google Scholar

Cyclic Haar graphs

Journal article published in 2002 by Milan Hladnik, Dragan Marusic, Tomaz Pisanski
This paper is made freely available by the publisher.
This paper is made freely available by the publisher.

Full text: Download

Green circle
Preprint: archiving allowed
Orange circle
Postprint: archiving restricted
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

For a given group Gamma with a generating set A, a dipole with \A\ parallel arcs (directed edges) labeled by elements of A gives rise to a voltage graph whose covering graph, denoted by H(Gamma, A) is a bipartite, regular graph, called a bi-Cayley graph. In the case when Gamma is abelian we refer to H(Gamma,A) as the Haar graph of Gamma with respect to the symbol A. In particular for Gamma cyclic the above graph is referred to as a cyclic Haar graph. A basic theory of cyclic Haar graphs is presented.