Back to search

University of Victoria (Canada)

Characterizing the polyhedral graphs with positive combinatorial curvature

Abstract

dc:description.abstract

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 PCC graph with two 39-faces and 208 vertices is constructed, matching the number of vertices of the largest PCC graphs discovered by Nicholson and Sneddon. A conjecture that there are no PCC graphs with faces of size larger than 39 is made, along with a proof that if there are no faces of size larger than 122, then there is an upper bound of 244 on the order of PCC graphs.

Degree

thesis:*
Level thesis:degree_level
Master of Science M.Sc.
Department thesis:degree_department
Department of Computer Science
Year dc:date.issued
2017

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Oldridge, Paul Richard
Advisor dc:contributor.supervisor
  • Myrvold, W. J. (Wendy Joanne)

Subjects

dc:subject × 5

Rights

dc:rights
Statement dc:rights
  • Available to the World Wide Web
Language dc:language.iso
en, English

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/1828/8030

Chain of custody

source
Harvested from
University of Victoria (Canada)
Base URL
dspace.library.uvic.ca/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Oldridge, Paul Richard. Characterizing the polyhedral graphs with positive combinatorial curvature. Master of Science M.Sc. thesis, 2017. http://hdl.handle.net/1828/8030