Kontakt
Kako kupovati
Dostava
Savjetnik za kupnju
Engleski
498 b
Do 30 dana za povrat
Kupci su kupili i
/
Meki uvez
46.83
€
/
Meki uvez
19.01
€
/
Meki uvez
14.76
€
/
Meki uvez
20.73
€
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).
Informacije o knjizi
Engleski
Poklonite ovu knjigu još danas
To je jednostavno
1 Dodajte knjigu u košaricu i odaberite isporuku kao poklon 2 Zauzvrat ćemo vam poslati kupon 3 Knjiga dolazi na adresu poklonoprimcaMoglo bi vas zanimati i
/
Meki uvez
13.04
€
/
Meki uvez
44.50
€
/
Meki uvez
15.77
€
Dobar dan! Ja sam Libroamiko, vaš književni savjetnik.
Kako vam mogu pomoći?