Skip to main content
SpringerLink
Log in

On the Ádám Conjecture on Circulant Graphs

  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1449))

Included in the following conference series:

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 to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Ádám, ‘Research problem 2–10’, J. Combinatorial Theory, 3 (1967).

    Google Scholar 

  2. B. Alspach and T. Parsons, ‘Isomorphism of circulant graphs and digraphs’, Discrete Math., 25 (1979), 97–108.

    Article  MathSciNet  Google Scholar 

  3. L. Babai, ‘Automorphism groups, isomorphism, reconstruction’ Handbook of Combinatorics, Elsevier, Amsterdam, 1995, 1749–1783.

    Google Scholar 

  4. 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.

    Article  Google Scholar 

  5. F. Boesch and R. Tindell, ‘Circulants and their connectivities’, J. of Graph Theory, 8 (1984), 487–499.

    Article  MathSciNet  Google Scholar 

  6. J. H. Conway and A. J. Jones, ‘Trigonometric diophantine equations (On vanishing sums of roots of unity)’, Acta Arithm., 30 (1976), 171–182.

    Article  MathSciNet  Google Scholar 

  7. 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.

    Article  MathSciNet  Google Scholar 

  8. N. Deo and M. Krishnamoorthy, ‘Toeplitz networks and their properties’, IEEE Trans. on Circuits and Sys., 36 (1989), 1089–1092.

    Article  MathSciNet  Google Scholar 

  9. B. Elspas and J. Turner, ‘Graphs with circulant adjacency matrices’, J. Comb. Theory, 9 (1970), 229–240.

    MathSciNet  MATH  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 

  11. X. G. Fang and M. Y. Xu, ‘On isomorphisms of Cayley graphs of small valency’, Algebra Colloquium, 1 (1994), 67–76.

    MathSciNet  MATH  Google Scholar 

  12. C. Godsil, Algebraic Combinatorics, Chapman and Hall, NY, 1993.

    MATH  Google Scholar 

  13. F. T. Leighton, Introduction to parallel algorithms and architectures: Arrays, trees, hypercubes, M. Kaufmann, 1992.

    Google Scholar 

  14. C.H. Li, ‘The cyclic groups with the m-DCI property’, European J. of Comb., 18 (1997), 655–665.

    Article  MathSciNet  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 

  16. H. B. Mann, ‘On linear relations between roots of unity’, Mathematika, 12 (1965), 171–182.

    Article  MathSciNet  Google Scholar 

  17. B. Mans, ‘Optimal Distributed algorithms in unlabeled tori and chordal rings’, Journal on Parallel and Distributed Computing, 46(1) (1997), 80–90.

    Article  Google Scholar 

  18. M. Muzychuk, ‘Ádám’s conjecture is true in the square free case’, J. of Combinatorial Theory, Series A, 72 (1995), 118–134.

    Article  MathSciNet  Google Scholar 

  19. M. Muzychuk, ‘On Ádám’s conjecture for circulant graphs’, Discrete Math., 167/168 (1997), 497–510.

    Article  MathSciNet  Google Scholar 

  20. P. P. Pálfy, ‘Isomorphism problem for relational structures with a cyclic automorphism’, Europ. J. Combin., 8 (1987), 35–43.

    Article  MathSciNet  Google Scholar 

  21. H.P. Schlickewei, ‘Equations in roots of unity’, Acta Arithm., 76 (1996), 171–182.

    Article  MathSciNet  Google Scholar 

  22. U. Zannier, ‘On the linear independence of roots of unity’, Acta Arithm., 50 (1989), 171–182.

    Article  Google Scholar 

  23. U. Zannier, ‘Vanishing sums of roots of unity’, Rend. Sem. Mat. Univ. Politec. Torino, 53 (1995), 487–495.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept of Computing, MPCE, Macquarie University, Sydney, NSW, 2109, Australia

    Bernard Mans & Igor Shparlinski

  2. Departimento di Matematica, Terza Università delgi Studi, Roma, 00146, Italy

    Francesco Pappalardi

Authors
  1. Bernard Mans
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Francesco Pappalardi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Igor Shparlinski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Information Science, Academia Sinica, 11529, Nankang, Taipei, Taiwan

    Wen-Lian Hsu

  2. Department of Computer Science, Yale University, 51 Prospect Street, New Haven, CT, 06520, USA

    Ming-Yang Kao

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation