TY - BOOK ID - 2645032 TI - Graph symmetry : algebraic methods and applications AU - Hahn, Gena AU - Sabidussi, Gert PY - 1997 VL - 497 SN - 0792346688 9048148855 9401589372 9780792346685 PB - Dordrecht: Kluwer, DB - UniCat KW - Cayley graphs KW - Group theory KW - Congresses KW - Discrete mathematics. KW - Computer science—Mathematics. KW - Group theory. KW - Computer communication systems. KW - Combinatorics. KW - Microprocessors. KW - Discrete Mathematics. KW - Discrete Mathematics in Computer Science. KW - Group Theory and Generalizations. KW - Computer Communication Networks. KW - Processor Architectures. KW - Minicomputers KW - Combinatorics KW - Algebra KW - Mathematical analysis KW - Communication systems, Computer KW - Computer communication systems KW - Data networks, Computer KW - ECNs (Electronic communication networks) KW - Electronic communication networks KW - Networks, Computer KW - Teleprocessing networks KW - Data transmission systems KW - Digital communications KW - Electronic systems KW - Information networks KW - Telecommunication KW - Cyberinfrastructure KW - Electronic data processing KW - Network computers KW - Groups, Theory of KW - Substitutions (Mathematics) KW - Discrete mathematical structures KW - Mathematical structures, Discrete KW - Structures, Discrete mathematical KW - Numerical analysis KW - Distributed processing KW - Cayley graphs. KW - Cayley color graphs KW - Cayley color groups KW - Cayley diagrams KW - Cayley's color graphs KW - Cayley's color groups KW - Cayley's diagrams KW - Cayley's graphs KW - Color graphs, Cayley KW - Color groups, Cayley KW - Dehnsche Gruppenbild KW - Diagrams, Cayley KW - Gruppenbild, Dehnsche KW - Graph theory KW - Graphes, Théorie des UR - https://www.unicat.be/uniCat?func=search&query=sysid:2645032 AB - 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. ER -