Skip to main content
SpringerLink
Log in

About planar cayley graphs

  • Communications
  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1995)

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

Included in the following conference series:

Abstract

Regarding non-normal Cayley graphs, we chose to let them aside from that paper. Though we obtained a few results about these, we could not reach the same complete formalism as for normal ones. Besides, they are rather pathological, in the sense that they do not admit imbeddings without singularities, such as accumulation points. For that reason, one may suppose they will not be as efficient models as normal Cayley graphs, and hence be of lesser interest for the community of computer scientists.

This work was partially supported by the Esprit Basic Research Action “Algebraic and Syntactic Methods In Computer Science” and by the PRC “Mathématique et Informatique”.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chaboud, T., and Kenyon, C., Planar Cayley Graphs with Regular Dual, accepted in Int. J. of Alg. and Comp., 1995.

    Google Scholar 

  2. Chaboud, T., About Planar Cayley Graphs, preprint, 1995.

    Google Scholar 

  3. Conway, J.H., and Lagarias, J.C., Tiling with Polyominoes and Combinatorial Group Theory, J. of Combinatorial Theory, A 53 (1990), pp. 183–208.

    Google Scholar 

  4. Fiduccia, C., et Zito, J., Commutative Cayley Graphs as Interconnection Network Architecture, 7th SIAM Conf. on Disc. Math. (1994)

    Google Scholar 

  5. Grünbaum, B., and Shephard, G.C., Tilings and Patterns, W.H. Freeman and Co., New York (1987).

    Google Scholar 

  6. Grünbaum, B., and Shephard, G.C., Incidence symbols and their applications, Proc. Symp. Pure Math. 34 (1979).

    Google Scholar 

  7. Lagarias, J.C., et Romano, A Polyomino Tiling of Thurston and its Configurational Entropy, Journal of Combinatorial Theory, A 63, pp. 338–358 (1993).

    Google Scholar 

  8. Lyndon, R.C. and Schupp, P.E., Combinatorial Group Theory, Springer-Verlag, Berlin (1977).

    Google Scholar 

  9. Róka, Zs., Automates Cellulaires sur Graphes de Cayley, PhD thesis, École Normale Supérieure de Lyon, 180–94, 1994.

    Google Scholar 

  10. Thurston, W.P., Conway's Tiling Groups, Amer. Math. Monthly, Oct 1990, pp. 757–773.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIP, ENS-Lyon, 69364, Lyon Cx 07, France

    Thomas Chaboud

Authors
  1. Thomas Chaboud
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Horst Reichel

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chaboud, T. (1995). About planar cayley graphs. In: Reichel, H. (eds) Fundamentals of Computation Theory. FCT 1995. Lecture Notes in Computer Science, vol 965. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60249-6_49

Download citation

  • DOI: https://doi.org/10.1007/3-540-60249-6_49

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60249-1

  • Online ISBN: 978-3-540-44770-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation