|
Title | Graph Symmetry : Algebraic Methods and Applications |
Author(s) | Hahn, Gena;Sabidussi, Gert |
Publication | Dordrecht, Springer Netherlands, 1997. |
Description | XX, 418 p : online resource |
Abstract Note | 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 |
ISBN,Price | 9789401589376 |
Keyword(s) | 1. COMBINATORICS
2. Computer Communication Networks
3. Computer communication systems
4. Computer science???Mathematics
5. DISCRETE MATHEMATICS
6. Discrete Mathematics in Computer Science
7. EBOOK
8. EBOOK - SPRINGER
9. GROUP THEORY
10. Group Theory and Generalizations
11. MICROPROCESSORS
12. Processor Architectures
|
Item Type | eBook |
Multi-Media Links
Please Click here for eBook
Circulation Data
Accession# | |
Call# | Status | Issued To | Return Due On | Physical Location |
I02352 |
|
|
On Shelf |
|
|
|
|