Isomorphic tetravalent cyclic Haar graphs
Abstract
Let S be a subset of the cyclic group n. The cyclic Haar graph H(n,S) is the bipartite graph with color classes n+ and n-, and edges \x+,y-\, where x,y ∈ n and y - x ∈ S. In this paper we give sufficient and necessary conditions for the isomorphism of two connected cyclic Haar graphs of valency 4.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.