Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
A. Ádám, ‘Research problem 2–10’, J. Combinatorial Theory, 3 (1967).
B. Alspach and T. Parsons, ‘Isomorphism of circulant graphs and digraphs’, Discrete Math., 25 (1979), 97–108.
L. Babai, ‘Automorphism groups, isomorphism, reconstruction’ Handbook of Combinatorics, Elsevier, Amsterdam, 1995, 1749–1783.
J.-C. Bermond, F. Comellas and D. F. Hsu, ‘Distributed loop computer networks: A survey’, Journal of Parallel and Distributed Computing, 24 (1995), 2–10.
F. Boesch and R. Tindell, ‘Circulants and their connectivities’, J. of Graph Theory, 8 (1984), 487–499.
J. H. Conway and A. J. Jones, ‘Trigonometric diophantine equations (On vanishing sums of roots of unity)’, Acta Arithm., 30 (1976), 171–182.
C. Delorme, O. Favaron and M. Maheo, ‘Isomorphisms of Cayley multigraphs of degree 4 on finite abelian groups’, European J. of Comb., 13 (1992), 59–61.
N. Deo and M. Krishnamoorthy, ‘Toeplitz networks and their properties’, IEEE Trans. on Circuits and Sys., 36 (1989), 1089–1092.
B. Elspas and J. Turner, ‘Graphs with circulant adjacency matrices’, J. Comb. Theory, 9 (1970), 229–240.
J.-H. Evertse and H. P. Schlickewei, ‘The absolute subspace theorem and linear equations with unknowns from a multiplicative group’, Preprint, 1997, 1–22.
X. G. Fang and M. Y. Xu, ‘On isomorphisms of Cayley graphs of small valency’, Algebra Colloquium, 1 (1994), 67–76.
C. Godsil, Algebraic Combinatorics, Chapman and Hall, NY, 1993.
F. T. Leighton, Introduction to parallel algorithms and architectures: Arrays, trees, hypercubes, M. Kaufmann, 1992.
C.H. Li, ‘The cyclic groups with the m-DCI property’, European J. of Comb., 18 (1997), 655–665.
B. Litow and B. Mans, ‘A note on the Ádám conjecture for double loops’, Inf. Proc. Lett., (to appear).
H. B. Mann, ‘On linear relations between roots of unity’, Mathematika, 12 (1965), 171–182.
B. Mans, ‘Optimal Distributed algorithms in unlabeled tori and chordal rings’, Journal on Parallel and Distributed Computing, 46(1) (1997), 80–90.
M. Muzychuk, ‘Ádám’s conjecture is true in the square free case’, J. of Combinatorial Theory, Series A, 72 (1995), 118–134.
M. Muzychuk, ‘On Ádám’s conjecture for circulant graphs’, Discrete Math., 167/168 (1997), 497–510.
P. P. Pálfy, ‘Isomorphism problem for relational structures with a cyclic automorphism’, Europ. J. Combin., 8 (1987), 35–43.
H.P. Schlickewei, ‘Equations in roots of unity’, Acta Arithm., 76 (1996), 171–182.
U. Zannier, ‘On the linear independence of roots of unity’, Acta Arithm., 50 (1989), 171–182.
U. Zannier, ‘Vanishing sums of roots of unity’, Rend. Sem. Mat. Univ. Politec. Torino, 53 (1995), 487–495.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mans, B., Pappalardi, F., Shparlinski, I. (1998). On the Ádám Conjecture on Circulant Graphs. In: Hsu, WL., Kao, MY. (eds) Computing and Combinatorics. COCOON 1998. Lecture Notes in Computer Science, vol 1449. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-68535-9_29
Download citation
DOI: https://doi.org/10.1007/3-540-68535-9_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64824-6
Online ISBN: 978-3-540-68535-7
eBook Packages: Springer Book Archive