On the Ádám Conjecture on Circulant Graphs
In this paper we study isomorphism between circulant graphs. Such graphs have a vast number of applications to telecommunication network, VLSI design and distributed computation [4,13,15,17]. By suitably choosing the length of the chord between two nodes of the network, one can achieve the appropriate property: e.g., low diameter, high connectivity, or implicit routing. A network that does provide labelled edges should be able to exploit the same properties as one with different labelling if the underlying graphs are isomorphic.
Unable to display preview. Download preview PDF.
- 1.A. Ádám, ‘Research problem 2–10’, J. Combinatorial Theory, 3 (1967).Google Scholar
- 3.L. Babai, ‘Automorphism groups, isomorphism, reconstruction’ Handbook of Combinatorics, Elsevier, Amsterdam, 1995, 1749–1783.Google Scholar
- 10.J.-H. Evertse and H. P. Schlickewei, ‘The absolute subspace theorem and linear equations with unknowns from a multiplicative group’, Preprint, 1997, 1–22.Google Scholar
- 13.F. T. Leighton, Introduction to parallel algorithms and architectures: Arrays, trees, hypercubes, M. Kaufmann, 1992.Google Scholar
- 15.B. Litow and B. Mans, ‘A note on the Ádám conjecture for double loops’, Inf. Proc. Lett., (to appear).Google Scholar