Description

December 4th 2010 | Paperback | PDF, EPUB, FB2, DjVu, audiobook, mp3, RTF | 418 pages | ISBN: 9789048148851 | 3.75 Mb

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,MoreThe 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.

Related Archive Books

Related Books

- AmatÃ¸ren
- 15.10.2018Tussen kunst en kitsch
- 07.12.2018The 66th Infantry and the Igorot Diary
- 15.04.2018Khyber Caravan: Through Kashmir, Waziristan, Afghanistan, Baluchistan And Northern India (A Canadian Pocket Book)
- 03.04.2018Building Materials for Life, Volume I
- 26.09.2020Anal Junky
- 10.06.2018Carnal Desires: Story Taster
- 01.07.2019Ludwig II. - Cosima Wagner. Briefwechsel
- 08.05.2018War and Trade in the West Indies, 1739-1763
- 20.01.2019Sheet Music Im Gonna Fly Away To The Sun

Comments