Characterizing the polyhedral graphs with positive combinatorial curvature
A polyhedral graph G is called PCC if every vertex of G has strictly positive combinatorial curvature and the graph is not a prism or antiprism. In this thesis it is shown that the maximum order of a 3-regular PCC graph is 132 and the 3-regular PCC graphs which match that bound are enumerated. A new...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | English en |
| Published: |
2017
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1828/8030 |