Graph Symmetry: Algebraic Methods and Applications
Gena Hahn · Gert Sabidussi
Mar 2013 · Nato Science Series C Buku 497 · Springer Science & Business Media
4,3star
27 ulasanreport
eBook
418
Halaman
reportRating dan ulasan tidak diverifikasi Pelajari Lebih Lanjut
Tentang eBook ini
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.
Rating dan ulasan
4,3
27 ulasan
Beri rating eBook ini
Sampaikan pendapat Anda.
Informasi bacaan
Smartphone dan tablet
Instal aplikasi Google Play Buku untuk Android dan iPad/iPhone. Aplikasi akan disinkronkan secara otomatis dengan akun Anda dan dapat diakses secara online maupun offline di mana saja.
Laptop dan komputer
Anda dapat mendengarkan buku audio yang dibeli di Google Play menggunakan browser web komputer.
eReader dan perangkat lainnya
Untuk membaca di perangkat e-ink seperti Kobo eReaders, Anda perlu mendownload file dan mentransfernya ke perangkat Anda. Ikuti petunjuk Pusat bantuan yang mendetail untuk mentransfer file ke eReaders yang didukung.
