Graph Symmetry: Algebraic Methods and Applications

Front Cover
Springer Science & Business Media, Jun 30, 1997 - Computers - 418 pages
0 Reviews
The last decade has seen parallel developments in computer science and combinatorics, both dealing with networks having strong symmetry properties. Both developments are centred on Cayley graphs: in the design of large interconnection networks, Cayley graphs arise as one of the most frequently used models; on the mathematical side, they play a central role as the prototypes of vertex-transitive graphs. The surveys published here provide an account of these developments, with a strong emphasis on the fruitful interplay of methods from group theory and graph theory that characterises the subject. Topics covered include: combinatorial properties of various hierarchical families of Cayley graphs (fault tolerance, diameter, routing, forwarding indices, etc.); Laplace eigenvalues of graphs and their relations to forwarding problems, isoperimetric properties, partition problems, and random walks on graphs; vertex-transitive graphs of small orders and of orders having few prime factors; distance transitive graphs; isomorphism problems for Cayley graphs of cyclic groups; infinite vertex-transitive graphs (the random graph and generalisations, actions of the automorphisms on ray ends, relations to the growth rate of the graph).

What people are saying - Write a review

We haven't found any reviews in the usual places.


Isomorphism and Cayley graphs on abelian groups
Oligomorphic groups and homogeneous graphs
Symmetry and eigenvectors
structure and symmetry
Cayley graphs and interconnection networks
Some applications of Laplace eigenvalues of graphs
Finite transitive permutation groups and finite vertextransitive graphs
Vertextransitive graphs and digraphs
Ends and automorphisms of infinite graphs

Other editions - View all

Common terms and phrases

References to this book