Hahn Gena (27 results)

Condition: New.

Paperback. Condition: New.

Condition: New. In.

Condition: New. pp. 276.

Paperback. Condition: Brand New. 276 pages. 9.25x6.10x0.63 inches. In Stock.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - What is the 'archetypal' image that comes to mind when one thinks of an infinite graph What with a finite graph - when it is thought of as opposed to an infinite one What structural elements are typical for either - by their presence or absence - yet provide a common ground for both In planning the workshop on 'Cycles and Rays' it had been intended from the outset to bring infinite graphs to the fore as much as possible. There never had been a graph theoretical meeting in which infinite graphs were more than 'also rans', let alone one in which they were a central theme. In part, this is a matter of fashion, inasmuch as they are perceived as not readily lending themselves to applications, in part it is a matter of psychology stemming from the insecurity that many graph theorists feel in the face of set theory - on which infinite graph theory relies to a considerable extent. The result is that by and large, infinite graph theorists know what is happening in finite graphs but not conversely. Lack of knowledge about infinite graph theory can also be found in authoritative l sources. For example, a recent edition (1987) of a major mathematical encyclopaedia proposes to '. . . restrict [itself] to finite graphs, since only they give a typical theory'. If anything, the reverse is true, and needless to say, the graph theoretical world knows better. One may wonder, however, by how much.

Condition: New.

Condition: New.

Condition: New.

Gebunden. Condition: New.

Condition: New. In.

Condition: New.

Buch. Condition: Neu. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 442 pp. Englisch.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.

Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.

Paperback. Condition: Brand New. 444 pages. 9.00x6.25x1.00 inches. In Stock.

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -What is the 'archetypal' image that comes to mind when one thinks of an infinite graph What with a finite graph - when it is thought of as opposed to an infinite one What structural elements are typical for either - by their presence or absence - yet provide a common ground for both In planning the workshop on 'Cycles and Rays' it had been intended from the outset to bring infinite graphs to the fore as much as possible. There never had been a graph theoretical meeting in which infinite graphs were more than 'also rans', let alone one in which they were a central theme. In part, this is a matter of fashion, inasmuch as they are perceived as not readily lending themselves to applications, in part it is a matter of psychology stemming from the insecurity that many graph theorists feel in the face of set theory - on which infinite graph theory relies to a considerable extent. The result is that by and large, infinite graph theorists know what is happening in finite graphs but not conversely. Lack of knowledge about infinite graph theory can also be found in authoritative l sources. For example, a recent edition (1987) of a major mathematical encyclopaedia proposes to '. . . restrict [itself] to finite graphs, since only they give a typical theory'. If anything, the reverse is true, and needless to say, the graph theoretical world knows better. One may wonder, however, by how much. 276 pp. Englisch.

Condition: New. Print on Demand pp. 276 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.

Condition: New. PRINT ON DEMAND pp. 276.

Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Proceedings of the NATO Advanced Research Workshop on Cycles and Rays: Basic Structures an Finite and Infinite Graphs, Montreal, Canada, May 3-9, 1987 What is the archetypal image that comes to mind when one thinks of an infinite graph? What with a .

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -What is the 'archetypal' image that comes to mind when one thinks of an infinite graph What with a finite graph - when it is thought of as opposed to an infinite one What structural elements are typical for either - by their presence or absence - yet provide a common ground for both In planning the workshop on 'Cycles and Rays' it had been intended from the outset to bring infinite graphs to the fore as much as possible. There never had been a graph theoretical meeting in which infinite graphs were more than 'also rans', let alone one in which they were a central theme. In part, this is a matter of fashion, inasmuch as they are perceived as not readily lending themselves to applications, in part it is a matter of psychology stemming from the insecurity that many graph theorists feel in the face of set theory - on which infinite graph theory relies to a considerable extent. The result is that by and large, infinite graph theorists know what is happening in finite graphs but not conversely. Lack of knowledge about infinite graph theory can also be found in authoritative l sources. For example, a recent edition (1987) of a major mathematical encyclopaedia proposes to '. . . restrict [itself] to finite graphs, since only they give a typical theory'. If anything, the reverse is true, and needless to say, the graph theoretical world knows better. One may wonder, however, by how much.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 276 pp. Englisch.

Taschenbuch. Condition: Neu. Cycles and Rays | Gena Hahn (u. a.) | Taschenbuch | 276 S. | Englisch | 2011 | Springer | EAN 9789401067195 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 440 pp. Englisch.

Buch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 442 pp. Englisch.

Taschenbuch. Condition: Neu. Graph Symmetry | Algebraic Methods and Applications | Gena Hahn (u. a.) | Taschenbuch | xx | Englisch | 2010 | Springer | EAN 9789048148851 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.

Buch. Condition: Neu. Graph Symmetry | Algebraic Methods and Applications | Gert Sabidussi (u. a.) | Buch | xx | Englisch | 1997 | Springer Netherland | EAN 9780792346685 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 440 pp. Englisch.