| eBook ISBN: | 978-1-4704-0186-3 |
| Product Code: | MEMO/126/601.E |
| List Price: | $45.00 |
| MAA Member Price: | $40.50 |
| AMS Member Price: | $27.00 |
| eBook ISBN: | 978-1-4704-0186-3 |
| Product Code: | MEMO/126/601.E |
| List Price: | $45.00 |
| MAA Member Price: | $40.50 |
| AMS Member Price: | $27.00 |
-
Book DetailsMemoirs of the American Mathematical SocietyVolume: 126; 1997; 75 ppMSC: Primary 05
The nine finite, planar, 3-connected, edge-transitive graphs have been known and studied for many centuries. The infinite, locally finite, planar, 3-connected, edge-transitive graphs can be classified according to the number of their ends (the supremum of the number of infinite components when a finite subgraph is deleted).
Prior to this study the 1-ended graphs in this class were identified by Grünbaum and Shephard as 1-skeletons of tessellations of the hyperbolic plane; Watkins characterized the 2-ended members. Any remaining graphs in this class must have uncountably many ends. In this work, infinite-ended members of this class are shown to exist. A more detailed classification scheme in terms of the types of Petrie walks in the graphs in this class and the local structure of their automorphism groups is presented. Explicit constructions are devised for all of the graphs in most of the classes under this new classification. Also included are partial results toward the complete description of the graphs in the few remaining classes.
ReadershipGraduate students and research mathematicians, chemists, and physicists interested in infinite repeating patterns.
-
Table of Contents
-
Chapters
-
1. Introduction
-
2. Preliminaries
-
3. Stabilizers
-
4. Petrie walks
-
5. Ends-separating circuits
-
6. Plane graphs of circuit type
-
7. Construction of plane graphs of mixed type
-
8. Deconstruction of plane graphs of mixed type
-
9. Ordinary graphs of mixed type
-
10. Extraordinary graphs of line type
-
11. Extraordinary graphs of mixed type
-
12. Conclusions, conjectures and open questions
-
Appendix A. Proof of Theorem 3.5
-
Appendix B. Proof of Theorem 4.2
-
-
RequestsReview Copy – for publishers of book reviewsPermission – for use of book, eBook, or Journal contentAccessibility – to request an alternate format of an AMS title
- Book Details
- Table of Contents
- Requests
The nine finite, planar, 3-connected, edge-transitive graphs have been known and studied for many centuries. The infinite, locally finite, planar, 3-connected, edge-transitive graphs can be classified according to the number of their ends (the supremum of the number of infinite components when a finite subgraph is deleted).
Prior to this study the 1-ended graphs in this class were identified by Grünbaum and Shephard as 1-skeletons of tessellations of the hyperbolic plane; Watkins characterized the 2-ended members. Any remaining graphs in this class must have uncountably many ends. In this work, infinite-ended members of this class are shown to exist. A more detailed classification scheme in terms of the types of Petrie walks in the graphs in this class and the local structure of their automorphism groups is presented. Explicit constructions are devised for all of the graphs in most of the classes under this new classification. Also included are partial results toward the complete description of the graphs in the few remaining classes.
Graduate students and research mathematicians, chemists, and physicists interested in infinite repeating patterns.
-
Chapters
-
1. Introduction
-
2. Preliminaries
-
3. Stabilizers
-
4. Petrie walks
-
5. Ends-separating circuits
-
6. Plane graphs of circuit type
-
7. Construction of plane graphs of mixed type
-
8. Deconstruction of plane graphs of mixed type
-
9. Ordinary graphs of mixed type
-
10. Extraordinary graphs of line type
-
11. Extraordinary graphs of mixed type
-
12. Conclusions, conjectures and open questions
-
Appendix A. Proof of Theorem 3.5
-
Appendix B. Proof of Theorem 4.2
