Wonder Club world wonders pyramid logo
×

Locally finite, planar, edge-transitive graphs Book

Locally finite, planar, edge-transitive graphs
Locally finite, planar, edge-transitive graphs, 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, Locally finite, planar, edge-transitive graphs has a rating of 4 stars
   2 Ratings
X
Locally finite, planar, edge-transitive graphs, 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, Locally finite, planar, edge-transitive graphs
4 out of 5 stars based on 2 reviews
5
50 %
4
0 %
3
50 %
2
0 %
1
0 %
Digital Copy
PDF format
1 available   for $99.99
Original Magazine
Physical Format

Sold Out

  • Locally finite, planar, edge-transitive graphs
  • Written by author Jack E. Graver,Mark E. Watkins
  • Published by Providence, R.I. : American Mathematical Society, c1997., 1997/06/12
  • 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
Buy Digital  USD$99.99

WonderClub View Cart Button

WonderClub Add to Inventory Button
WonderClub Add to Wishlist Button
WonderClub Add to Collection Button

Book Categories

Authors

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 Grunbaum 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.


Login

  |  

Complaints

  |  

Blog

  |  

Games

  |  

Digital Media

  |  

Souls

  |  

Obituary

  |  

Contact Us

  |  

FAQ

CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!!

X
WonderClub Home

This item is in your Wish List

Locally finite, planar, edge-transitive graphs, 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, Locally finite, planar, edge-transitive graphs

X
WonderClub Home

This item is in your Collection

Locally finite, planar, edge-transitive graphs, 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, Locally finite, planar, edge-transitive graphs

Locally finite, planar, edge-transitive graphs

X
WonderClub Home

This Item is in Your Inventory

Locally finite, planar, edge-transitive graphs, 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, Locally finite, planar, edge-transitive graphs

Locally finite, planar, edge-transitive graphs

WonderClub Home

You must be logged in to review the products

E-mail address:

Password: