Graph Symmetry - Algebraic Methods and Applications (Paperback, Softcover reprint of hardcover 1st ed. 1997)

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

General

Imprint:	Springer
Country of origin:	Netherlands
Series:	NATO Science Series C, 497
Release date:	December 2010
First published:	1997
Editors:	Gena Hahn • Gert Sabidussi
Dimensions:	240 x 160 x 22mm (L x W x T)
Format:	Paperback
Pages:	418
Edition:	Softcover reprint of hardcover 1st ed. 1997
ISBN-13:	978-90-481-4885-1
Categories:	Books > Science & Mathematics > Mathematics > Combinatorics & graph theory Promotions
LSN:	90-481-4885-5
Barcode:	9789048148851

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!