Kontakt
Jak nakupovat
Doručení
Nákupní rádce
Angličtina
471 b
Až 30 dní na vrácení zboží
Zákazníci také koupili
/
Brožovaná
1 077
Kč
/
Brožovaná
485
Kč
/
Brožovaná
374
Kč
/
Brožovaná
525
Kč
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).
Informace o knize
Angličtina
Kategorie
Darujte tuto knihu ještě dnes
Je to snadné
1 Přidejte knihu do košíku a zvolte doručit jako dárek 2 Obratem vám zašleme poukaz 3 Kniha dorazí na adresu obdarovanéhoMohlo by vás také zajímat
/
Brožovaná
299
Kč
/
Brožovaná
1 014
Kč
/
Brožovaná
358
Kč
Ahoj! Jsem Libroamiko, tvůj knižní rádce.
Jak ti můžu pomoct?