EUR 180,07
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 225,76
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Condizione: New. pp. 444.
Lingua: Inglese
Editore: Springer Netherlands, Springer Netherlands, 1997
ISBN 10: 0792346688 ISBN 13: 9780792346685
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 223,11
Quantità: 1 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.
Lingua: Inglese
Editore: Springer Netherlands Jun 1997, 1997
ISBN 10: 0792346688 ISBN 13: 9780792346685
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
EUR 213,99
Quantità: 2 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 442 pp. Englisch.
Da: preigu, Osnabrück, Germania
EUR 186,70
Quantità: 5 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. Graph Symmetry | Algebraic Methods and Applications | Gert Sabidussi (u. a.) | Buch | Nato Science Series C: | xx | Englisch | 1997 | Springer Netherland | EAN 9780792346685 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.
Lingua: Inglese
Editore: Springer Netherlands, Springer Netherlands Jun 1997, 1997
ISBN 10: 0792346688 ISBN 13: 9780792346685
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
EUR 213,99
Quantità: 1 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 442 pp. Englisch.
Da: Majestic Books, Hounslow, Regno Unito
EUR 307,17
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. Print on Demand pp. 444 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 302,32
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. PRINT ON DEMAND pp. 444.