Skip to main content
SpringerLink
Log in

Graph Symmetry

Algebraic Methods and Applications

  • Book
  • © 1997

Overview

Editors:
  1. Geňa Hahn

    1. Départment d’Informatique et de Recherche opérationnelle, Université de Montréal, Montréal, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Gert Sabidussi

    1. Départment de Mathématiques et de Statistique, Université de Montréal, Montréal, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Nato Science Series C: (ASIC, volume 497)

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

Access this book

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

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (9 chapters)

  1. Front Matter

    Pages i-xix
    Download chapter PDF

  2. Isomorphism and Cayley graphs on abelian groups

    • Brian Alspach
    Pages 1-22

  3. Oligomorphic groups and homogeneous graphs

    • Peter J. Cameron
    Pages 23-74

  4. Symmetry and eigenvectors

    • Ada Chan, Chris D. Godsil
    Pages 75-106

  5. Graph homomorphisms: structure and symmetry

    • Geňa Hahn, Claude Tardif
    Pages 107-166

  6. Cayley graphs and interconnection networks

    • Marie-Claude Heydemann
    Pages 167-224

  7. Some applications of Laplace eigenvalues of graphs

    • Bojan Mohar
    Pages 225-275

  8. Finite transitive permutation groups and finite vertex-transitive graphs

    • Cheryl E. Praeger, Cai Heng Li, Alice C. Niemeyer
    Pages 277-318

  9. Vertex-transitive graphs and digraphs

    • Raffaele Scapellato
    Pages 319-378

  10. Ends and automorphisms of infinite graphs

    • Mark E. Watkins
    Pages 379-414

  11. Back Matter

    Pages 415-418
    Download chapter PDF
Back to top

Keywords

About this book

The last decade has seen two parallel developments, one in computer science, the other in mathematics, both dealing with the same kind of combinatorial structures: networks with strong symmetry properties or, in graph-theoretical language, vertex-transitive graphs, in particular their prototypical examples, Cayley graphs. In the design of large interconnection networks it was realised that many of the most fre­ quently used models for such networks are Cayley graphs of various well-known groups. This has spawned a considerable amount of activity in the study of the combinatorial properties of such graphs. A number of symposia and congresses (such as the bi-annual IWIN, starting in 1991) bear witness to the interest of the computer science community in this subject. On the mathematical side, and independently of any interest in applications, progress in group theory has made it possible to make a realistic attempt at a complete description of vertex-transitive graphs. The classification of the finite simple groups has played an important role in this respect.

Editors and Affiliations

  • Départment d’Informatique et de Recherche opérationnelle, Université de Montréal, Montréal, Canada

    Geňa Hahn

  • Départment de Mathématiques et de Statistique, Université de Montréal, Montréal, Canada

    Gert Sabidussi

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation