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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.