Highly Influenced

# Isomorphism Problem for Relational Structures with a Cyclic Automorphism

@article{Plfy1987IsomorphismPF, title={Isomorphism Problem for Relational Structures with a Cyclic Automorphism}, author={P{\'e}ter P. P{\'a}lfy}, journal={Eur. J. Comb.}, year={1987}, volume={8}, pages={35-43} }

- Published 1987 in Eur. J. Comb.
DOI:10.1016/S0195-6698(87)80018-5

The problem we discuss here is the conjecture of Adam [I) concerning the isomorphism problem of cyclic (or, in other words, circulant) graphs and its generalization by Babai [4). We attempt to give a fairly complete survey of results related to Adam's conjecture. We prove that the isomorphism classes of all n-element relational structures (not only graphs) with cyclic automorphism have the anticipated simple form if and only if (n, <p(n» = I or n = 4, where <p(n) is Euler's <p function. The… CONTINUE READING

#### From This Paper

##### Figures, tables, and topics from this paper.

36 Citations

16 References

Similar Papers