Back to Search Start Over

Cyclic Haar graphs

Authors :
Hladnik, Milan
Marušič, Dragan
Pisanski, Tomaž
Source :
Discrete Mathematics. Feb2002, Vol. 244 Issue 1-3, p137. 16p.
Publication Year :
2002

Abstract

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

Details

Language :
English
ISSN :
0012365X
Volume :
244
Issue :
1-3
Database :
Academic Search Index
Journal :
Discrete Mathematics
Publication Type :
Academic Journal
Accession number :
7750791
Full Text :
https://doi.org/10.1016/S0012-365X(01)00064-4