ISBN: 9789048148851

Cayley graphs and interconnection networks. - Ends and automorphisms of infinite graphs. In the design of large interconnection networks it was realised that many of the most fre. The wor… Meer...

Cayley graphs and interconnection networks. - Ends and automorphisms of infinite graphs. In the design of large interconnection networks it was realised that many of the most fre. The world needs you to lead. The Nile on eBay   Graph Symmetry by Gena Hahn, Gert Sabidussi 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. FORMATPaperback LANGUAGEEnglish CONDITIONBrand New Publisher Description 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). Notes Springer Book Archives Flap The world needs you to lead. We face unprecedented challenges and rapid change at all levels of society. But the solution to almost every problem we face is clear: We need leadership that can adapt and that puts people first. Sharing stories from the front and insights born from overcoming adversity on both the battlefield and in the boardroom, Lt. Gen. Rick Lynch offers nine impactful leadership principles to help you develop your own effective and flexible leadership style. From earning respect and working effectively with diverse teams to adapting to new technology and laying a foundation of trust built upon integrity, these principles are what set apart the leader who is merely equipped and the leader who excels. "I believe in the power of individuals to change their circumstances, to change their environment, to change the course of their home life and workplaces, and to change for the better," Lynch says. You have what it takes to lead the way in our ever-changing world. Are you ready to start your training? Table of Contents Isomorphism and Cayley graphs on abelian groups.- Oligomorphic groups and homogeneous graphs.- Symmetry and eigenvectors.- Graph homomorphisms: structure and symmetry.- Cayley graphs and interconnection networks.- Some applications of Laplace eigenvalues of graphs.- Finite transitive permutation groups and finite vertex-transitive graphs.- Vertex-transitive graphs and digraphs.- Ends and automorphisms of infinite graphs. Promotional Springer Book Archives Long Description 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 Details ISBN9048148855 Publisher Springer Year 2010 ISBN-10 9048148855 ISBN-13 9789048148851 Format Paperback Imprint Springer Place of Publication Dordrecht Country of Publication Netherlands Edited by Gert Sabidussi DEWEY 511.5 Birth 1949 Edition 1st Short Title GRAPH SYMMETRY Language English Media Book Series Number 497 Series NATO Science Series C Pages 418 Subtitle Algebraic Methods and Applications Illustrations XX, 418 p. Publication Date 2010-12-04 Author Gert Sabidussi Edition Description Softcover reprint of hardcover 1st ed. 1997 Alternative 9780792346685 Audience Postgraduate, Research & Scholarly We've got thisAt The Nile, if you're looking for it, we've got it.With fast shipping, low prices, friendly service and well over a million items - you're bound to find what you want, at a price you'll love! TheNile_Item_ID:96231617; , Festpreisangebot, [LT: FixedPrice], ISBN-13: 9789048148851, Book Title: Graph Symmetry<

2010, ISBN: 9789048148851

gebonden uitgave

[ED: Taschenbuch], [PU: Springer Netherland], The last decade has seen two parallel developments, one in computer science, the other in mathematics, both dealing with the same kind of com… Meer...

[ED: Taschenbuch], [PU: Springer Netherland], 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..., DE, [SC: 0.00], Neuware, gewerbliches Angebot, 440, [GW: 663g], Softcover reprint of hardcover 1st ed. 1997, Banküberweisung, PayPal, [CT: Sonstiges / Sonstiges]<

2010, ISBN: 9789048148851

Editor: Hahn, Gena, Editor: Sabidussi, Gert, Springer, Paperback, Auflage: Softcover reprint of hardcover 1st ed. 1997, 438 Seiten, Publiziert: 2010-12-04T00:00:01Z, Produktgruppe: Book, … Meer...

Editor: Hahn, Gena, Editor: Sabidussi, Gert, Springer, Paperback, Auflage: Softcover reprint of hardcover 1st ed. 1997, 438 Seiten, Publiziert: 2010-12-04T00:00:01Z, Produktgruppe: Book, Hersteller-Nr.: biography, 0.61 kg, Architecture & Microprocessors, Computer Science, Computing & Internet, Subjects, Books, Systems Analysis & Design, Network Topics, Networking & Security, Algebra, Mathematics, Science, Nature & Maths, Combinatorics & Graph Theory, Discrete Mathematics, Scientific, Technical & Medical, Springer, 2010<