Limit this search to....

Graph Symmetry: Algebraic Methods and Applications
Contributor(s): Hahn, Gena (Editor), Sabidussi, Gert (Editor)
ISBN: 9048148855     ISBN-13: 9789048148851
Publisher: Springer
OUR PRICE:   $208.99  
Product Type: Paperback - Other Formats
Published: December 2010
Qty:
Additional Information
BISAC Categories:
- Mathematics | Graphic Methods
- Mathematics | Discrete Mathematics
- Computers | Systems Architecture - General
Dewey: 511.5
Series: NATO Science Series C:
Physical Information: 0.89" H x 6.14" W x 9.21" (1.35 lbs) 418 pages
 
Descriptions, Reviews, Etc.
Publisher Description:
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.