Isomorphic tetravalent cyclic Haar graphs
Combinatorics
2012-12-14 v1
Abstract
Let be a subset of the cyclic group . The cyclic Haar graph is the bipartite graph with color classes and and edges where and . In this paper we give sufficient and necessary conditions for the isomorphism of two connected cyclic Haar graphs of valency 4.
Keywords
Cite
@article{arxiv.1212.3208,
title = {Isomorphic tetravalent cyclic Haar graphs},
author = {Sergio Hiroki Koike-Quintanar and István Kovács},
journal= {arXiv preprint arXiv:1212.3208},
year = {2012}
}