Graph Symmetry: Algebraic Methods and Applications / Edition 1

by Gena Hahn, Gert Sabidussi

Overview

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.

Product Details

ISBN-13:	9780792346685
Publisher:	Springer Netherlands
Publication date:	06/30/1997
Series:	Nato Science Series C: , #497
Edition description:	1997
Pages:	418
Product dimensions:	8.27(w) x 11.69(h) x 0.24(d)

Table of Contents

Isomorphism and Cayley graphs on abelian groups.- Oligomorphic groups and homogeneous graphs.- Symmetry and eigenvectors.- Graph homomorphisms: structure and symmetry.- Cayley graphs and interconnection networks.- Some applications of Laplace eigenvalues of graphs.- Finite transitive permutation groups and finite vertex-transitive graphs.- Vertex-transitive graphs and digraphs.- Ends and automorphisms of infinite graphs.

Editorial Reviews

Nine papers present mathematicians with parallel developments in computer science and mathematics relating to networks with strong symmetry properties, vertix-transitive graphs in graph-theoretical language, particularly their prototypical examples, Cayley graphs. Revolving around the common theme of group theory via Cayley graphs, they expose graph theorists to the combinatorial problems encountered in the design of large, highly symmetrical networks, and provide an overview of the group theoretical methods that enter into the structural classification of such networks. Annotation c. by Book News, Inc., Portland, Or.

Booknews