Artículos relacionados a Graph Symmetry: Algebraic Methods and Applications:...

Graph Symmetry: Algebraic Methods and Applications: 497 (NATO Science Series C) - Tapa dura

 
9780792346685: Graph Symmetry: Algebraic Methods and Applications: 497 (NATO Science Series C)

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

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.

Reseña del editor

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 a strong emphasis on the fruitful interplay of methods from group theory and graph theory that characterises 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 generalisations, actions of the automorphisms on ray ends, relations to the growth rate of the graph).

"Sobre este título" puede pertenecer a otra edición de este libro.

  • EditorialSpringer
  • Año de publicación1997
  • ISBN 10 0792346688
  • ISBN 13 9780792346685
  • EncuadernaciónTapa dura
  • IdiomaInglés
  • Número de páginas444
  • EditorHahn Gena, Sabidussi Gert
  • Contacto del fabricanteno disponible

Comprar nuevo

Ver este artículo

EUR 11,00 gastos de envío desde Alemania a España

Destinos, gastos y plazos de envío

Otras ediciones populares con el mismo título

9789048148851: Graph Symmetry: Algebraic Methods and Applications: 497 (Nato Science Series C:)

Edición Destacada

ISBN 10:  9048148855 ISBN 13:  9789048148851
Editorial: Springer, 2010
Tapa blanda

Resultados de la búsqueda para Graph Symmetry: Algebraic Methods and Applications:...

Imagen del vendedor

Gert Sabidussi
Publicado por Springer Netherlands Jun 1997, 1997
ISBN 10: 0792346688 ISBN 13: 9780792346685
Nuevo Tapa dura
Impresión bajo demanda

Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Buch. Condición: 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. Nº de ref. del artículo: 9780792346685

Contactar al vendedor

Comprar nuevo

EUR 213,99
Convertir moneda
Gastos de envío: EUR 11,00
De Alemania a España
Destinos, gastos y plazos de envío

Cantidad disponible: 2 disponibles

Añadir al carrito

Imagen del vendedor

Gert Sabidussi
ISBN 10: 0792346688 ISBN 13: 9780792346685
Nuevo Tapa dura

Librería: AHA-BUCH GmbH, Einbeck, Alemania

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Buch. Condición: 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. Nº de ref. del artículo: 9780792346685

Contactar al vendedor

Comprar nuevo

EUR 223,11
Convertir moneda
Gastos de envío: EUR 11,99
De Alemania a España
Destinos, gastos y plazos de envío

Cantidad disponible: 1 disponibles

Añadir al carrito

Imagen de archivo

Publicado por Springer, 1997
ISBN 10: 0792346688 ISBN 13: 9780792346685
Nuevo Tapa dura

Librería: Ria Christie Collections, Uxbridge, Reino Unido

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Condición: New. In. Nº de ref. del artículo: ria9780792346685_new

Contactar al vendedor

Comprar nuevo

EUR 233,71
Convertir moneda
Gastos de envío: EUR 4,72
De Reino Unido a España
Destinos, gastos y plazos de envío

Cantidad disponible: Más de 20 disponibles

Añadir al carrito

Imagen del vendedor

Hahn, Gena|Sabidussi, Gert
Publicado por Springer Netherlands, 1997
ISBN 10: 0792346688 ISBN 13: 9780792346685
Nuevo Tapa dura

Librería: moluna, Greven, Alemania

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Gebunden. Condición: New. Nº de ref. del artículo: 5968180

Contactar al vendedor

Comprar nuevo

EUR 227,74
Convertir moneda
Gastos de envío: EUR 19,49
De Alemania a España
Destinos, gastos y plazos de envío

Cantidad disponible: Más de 20 disponibles

Añadir al carrito

Imagen del vendedor

Gert Sabidussi
ISBN 10: 0792346688 ISBN 13: 9780792346685
Nuevo Tapa dura

Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Buch. Condición: 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. Nº de ref. del artículo: 9780792346685

Contactar al vendedor

Comprar nuevo

EUR 213,99
Convertir moneda
Gastos de envío: EUR 35,00
De Alemania a España
Destinos, gastos y plazos de envío

Cantidad disponible: 2 disponibles

Añadir al carrito

Imagen de archivo

Publicado por Springer, 1997
ISBN 10: 0792346688 ISBN 13: 9780792346685
Nuevo Tapa dura

Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Condición: New. Nº de ref. del artículo: ABLIING23Feb2416190182588

Contactar al vendedor

Comprar nuevo

EUR 208,85
Convertir moneda
Gastos de envío: EUR 65,92
De Estados Unidos de America a España
Destinos, gastos y plazos de envío

Cantidad disponible: Más de 20 disponibles

Añadir al carrito