Isomorphic tetravalent cyclic Haar graphs

2012/12/13 by Koike-Quintanar, Sergio Hiroki, Kovács, István · 1 citation
#05C25 #05C60 #20B25 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1212.3208

Abstract

Let S be a subset of the cyclic group \Z_n. The cyclic Haar graph H(\Z_n,S) is the bipartite graph with color classes \Z_n⁺ and \Z_n^-, and edges \x⁺,y^-\, where x,y ∈ \Z_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.

Cited by

• On kernel isomorphisms of m-Cayley digraphs and finite 2PCI-groups

Related

• On the BCI Problem
• Basic Tetravalent Oriented Graphs with Cyclic Normal Quotients
• Haar graphical representations of finite groups and an application to poset representations
• Which Haar graphs are Cayley graphs?
• On groups all of whose Haar graphs are Cayley graphs