Graph Symmetry - Algebraic Methods and Applications (Hardcover, 1997 ed.)

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

General

Imprint:	Springer
Country of origin:	Netherlands
Series:	NATO Science Series C, 497
Release date:	2001
First published:	June 1997
Editors:	Gena Hahn • Gert Sabidussi
Dimensions:	297 x 210 x 25mm (L x W x T)
Format:	Hardcover
Pages:	418
Edition:	1997 ed.
ISBN-13:	978-0-7923-4668-5
Categories:	Books > Science & Mathematics > Mathematics > Combinatorics & graph theory
LSN:	0-7923-4668-8
Barcode:	9780792346685

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!