Graph Symmetry: Algebraic Methods and Applications
N/A
ISBN 10: 0792346688 ISBN 13: 9780792346685
Editore: Springer, 1997
Nuovi
Rilegato
Da
Kennys Bookstore, Olney, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Venditore AbeBooks dal 9 ottobre 2009
Questo articolo specifico non è più disponibile.
Riguardo questo articolo
Descrizione:
1997. Hardcover. . . . . . Books ship from the US and Ireland. Codice articolo V9780792346685
Riassunto:
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.
Contenuti: Preface. Isomorphism and Cayley Graphs on Abelian Groups; B. Alspach. Oligomorphic Groups and Homogeneous Graphs; P.J. Cameron. Symmetry and Eigenvectors; A. Chan, C.D. Godsil. Graph Homomorphisms: Structure and Symmetry; G. Hahn, C. Tardif. Cayley Graphs and Interconnection Networks; B. Mohar. Finite Transitive Permutation Groups and Finite Vertex-Transitive Graphs; C.E. Praeger. Vertex-Transitive Graphs and Digraphs; R. Scapellato. Ends and Automorphisms of Infinite Graphs; M.E. Watkins. Index.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Dati bibliografici
Titolo: Graph Symmetry: Algebraic Methods and ...
Casa editrice: Springer
Data di pubblicazione: 1997
Legatura: Rilegato
Condizione: New
I migliori risultati di ricerca su AbeBooks
Immagini fornite dal venditore
Graph Symmetry
Da: moluna, Greven, Germania
Valutazione del venditore 4 su 5 stelle
Gebunden. Condizione: New. Codice articolo 5968180
Quantità: Più di 20 disponibili
Foto dell'editore
Graph Symmetry: Algebraic Methods and Applications (Nato Science Series C:, 497)
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo ABLIING23Feb2416190182588
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Graph Symmetry : Algebraic Methods and Applications
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 755713-n
Quantità: 15 disponibili
Foto dell'editore
Graph Symmetry (Hardcover)
Editore:
Kluwer Academic Publishers, Dordrecht, 1997
ISBN 10: 0792346688
ISBN 13: 9780792346685
Nuovo
Rilegato
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: new. Hardcover. 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 emphasis on the interplay of methods from group theory and graph theory that characterizes 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 generalizations, actions of the automorphisms on ray ends, relations to the growth rate of the graph). 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Codice articolo 9780792346685
Quantità: 1 disponibili
Immagini fornite dal venditore
Graph Symmetry
Editore:
Springer Netherlands, Springer Netherlands Jun 1997, 1997
ISBN 10: 0792346688
ISBN 13: 9780792346685
Nuovo
Rilegato
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: Neu. 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. Codice articolo 9780792346685
Quantità: 2 disponibili
Immagini fornite dal venditore
Graph Symmetry
Editore:
Springer Netherlands Jun 1997, 1997
ISBN 10: 0792346688
ISBN 13: 9780792346685
Nuovo
Rilegato
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Buch. 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. Codice articolo 9780792346685
Quantità: 2 disponibili
Foto dell'editore
Graph Symmetry: Algebraic Methods and Applications (Nato Science Series C:, 497)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9780792346685_new
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Graph Symmetry : Algebraic Methods and Applications
Editore:
Springer Netherlands, Springer Netherlands, 1997
ISBN 10: 0792346688
ISBN 13: 9780792346685
Nuovo
Rilegato
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Buch. 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. Codice articolo 9780792346685
Quantità: 1 disponibili
Immagini fornite dal venditore
Graph Symmetry : Algebraic Methods and Applications
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: As New. Unread book in perfect condition. Codice articolo 755713
Quantità: 15 disponibili
Foto dell'editore
Graph Symmetry (Hardcover)
Editore:
Kluwer Academic Publishers, Dordrecht, 1997
ISBN 10: 0792346688
ISBN 13: 9780792346685
Nuovo
Rilegato
Da: AussieBookSeller, Truganina, VIC, Australia
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: new. Hardcover. 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 emphasis on the interplay of methods from group theory and graph theory that characterizes 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 generalizations, actions of the automorphisms on ray ends, relations to the growth rate of the graph). 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. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. Codice articolo 9780792346685
Quantità: 1 disponibili