Sparse surface graphs
Shakir, Qays Rashid
MetadataShow full item record
This item's downloads: 0 (view details)
This thesis is concerned with building certain classes of sparse and tight surface graphs via suitable sets of inductive moves from specified sets of irreducible surface graphs. In particular, we derive topological inductive constructions for (2,2)-tight surface graphs in the case of the sphere, the cylinder and the torus. We present theorems and results that determine the number of the irreducible (2,2)-tight sphere, cylinder and torus graphs. We also found all irreducible (2,2)-tight torus graphs using two independent approaches. One of these approaches is based on calculation by hand. We employed a mixture of brute force methods and theoretical insight into the structure of such graphs. The other approach is a computer assisted search. Consequently, we found that there are exactly 116 irreducible (2,2)-tight torus graphs. We also organise and present all irreducible (2,2)-tight torus graphs. This thesis also includes a geometric application of configurations to circular arcs, in the spirit of the Keobe-Andreev-Thurston circle packing theorem. We used the inductive construction of (2,2)-tight torus graphs to show that every (2,2) -tight torus graph is the contact graph of a collection of circular arcs in the flat torus.
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 3.0 Ireland
Showing items related by title, author, creator and subject.
Campinas, Stéphane (2016-08-31)The advent of the Internet enabled the sharing of information between people all around the world. Projects like Wikipedia have made human knowledge accessible to anybody with a simple mouse click. The Linked Data movement ...
O'Mahony, Olga (2017-11-21)A simple undirected finite graph G has the me_2-property if every pair of distinct vertices of G is connected by a path of length 2, but this property does not survive the deletion of an edge. If u and v are adjacent ...
Cruickshank, J.; McLaughlin, J. (Universitat Autonoma de Barcelona, 2011-07-01)We study spaces of realisations of linkages (weighted graphs) whose underlying graph is a series parallel graph. In particular, we describe an algorithm for determining whether or not such spaces are connected.