On Recognizing Cayley Graphs
Given a class C of Cayley graphs, and given an edge-colored graph G of n vertices and m edges, we are interested in the problem of checking whether there exists an isomorphism φ preserving the colors such that G is isomorphic by φ to a graph in C colored by the elements of its generating set. In this paper, we give an O(m log n)-time algorithm to check whether G is color-isomorphic to a Cayley graph, improving a previous O(n 4.752 log n) algorithm. In the case where C is the class of the Cayley graphs defined on Abelian groups, we give an optimal O(m)-time algorithm. This algorithm can be extended to check color-isomorphism with Cayley graphs on Abelian groups of given rank. Finally, we propose an optimal O(m)-time algorithm that tests color-isomorphism between two Cayley graphs on ℤn, i.e., between two circulant graphs. This latter algorithm is extended to an optimal O(n)-time algorithm that tests colorisomorphism between two Abelian Cayley graphs of bounded degree.
Unable to display preview. Download preview PDF.
- 3.L. Babai. Automorphism groups, isomorphism, reconstruction. In R. Graham, M. Grötschel, and L. Lovász, editors, Handbook of Combinatorics, vol. 2. Elsevier and MIT Press, 1995.Google Scholar
- 4.G. Birkhoff and S. MacLane. Algebra. Macmillan, 1967.Google Scholar
- 8.P. Flocchini, B. Mans, and N. Santoro. Sense of direction in distributed computing. In Proceedings of DISC’ 98, LNCS vol. 1499, Springer-Verlag, S. Kutten (Ed.), pages 1–15, 1998.Google Scholar
- 11.T. Leighton Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, 1992.Google Scholar
- 13.G. Miller. On the nlog n isomorphism technique. In Proceedings Tenth Annual ACM Symposium on Theory of Computing (STOC), pp. 51–58, 1978.Google Scholar
- 15.M. Muzychuk and G. Tinhoffer. Recognizing circulant graphs of prime order in polynomial time. The electronic journal of combinatorics, 3, 1998.Google Scholar