Institutional Repository

Classes of arrangement graphs in three dimensions

DSpace/Manakin Repository

Show simple item record

dc.contributor.advisor Wismath, Stephen
dc.contributor.advisor Gaur, Daya Nickle, Elspeth J. University of Lethbridge. Faculty of Arts and Science 2008-04-03T20:39:49Z 2008-04-03T20:39:49Z 2005
dc.description x, 89 leaves : ill. (some col.) ; 29 cm en
dc.description.abstract A 3D arrangement graph G is the abstract graph induced by an arrangement of planes in general position where the intersection of any two planes forms a line of intersection and an intersection of three planes creates a point. The properties of three classes of arrangement graphs — four, five and six planes — are investigated. For graphs induced from six planes, specialized methods were developed to ensure all possible graphs were discovered. The main results are: the number of 3D arrangement graphs induced by four, five and six planes are one, one and 43 respectively; the three classes are Hamiltonian; and the 3D arrangement graphs created from four and five planes are planar but none of the graphs created from six planes are planar. en
dc.language.iso en_US en
dc.publisher Lethbridge, Alta. : University of Lethbridge, Faculty of Arts and Science, 2005 en
dc.relation.ispartofseries Thesis (University of Lethbridge. Faculty of Arts and Science) en
dc.subject Graph theory en
dc.subject Computer graphics en
dc.subject Geometrical constructions en
dc.subject Graphic methods en
dc.subject Dissertations, Academic en
dc.title Classes of arrangement graphs in three dimensions en
dc.type Thesis en
dc.publisher.faculty Faculty of Arts and Science en
dc.publisher.department Department of Mathematics and Computer Science en Masters

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace

Advanced Search


My Account