A comparison of vertex-splitting and spider-splitting for the study of three-dimensional rigidity

Show simple item record

dc.contributor.advisor Finbow-Singh, Wendy
dc.creator d'Eon, Jason N.
dc.date.accessioned 2018-06-13T14:19:18Z
dc.date.available 2018-06-13T14:19:18Z
dc.date.issued 2018
dc.identifier.uri http://library2.smu.ca/handle/01/27553
dc.description 1 online resource (42 p.) : illustrations
dc.description Includes abstract.
dc.description Includes bibliographical references (p. 41-42).
dc.description.abstract In two dimensions, generic rigidity is a combinatorial property of a framework, but extensions into three dimensions fail to completely characterize generic rigidity. It is therefore interesting to investigate two graph operations introduced by Walter Whiteley, vertex-splitting and spider-splitting, which are known to take a minimally rigid framework in three dimensions to a new minimally rigid framework with an additional vertex. We present algorithms for generating all possible graphs obtained by vertex-splitting, spider-splitting, and combinations of vertex-splitting and spider-splitting. For graphs with up to and including 8 vertices, the set of graphs obtained by spider-splitting is a subset of the set obtained by vertex-splitting. Additionally, the set produced by combinations of vertex-splitting and spider-splitting is equal to the set obtained by vertex-splitting. This suggests that as a method for generating rigid graphs, spider-splitting is inferior to vertex-splitting at all steps of iteration. en_CA
dc.description.provenance Submitted by Greg Hilliard (greg.hilliard@smu.ca) on 2018-06-13T14:19:18Z No. of bitstreams: 1 d'Eon_Jason_Honours_2018.pdf: 271943 bytes, checksum: 1320117e26c2730df5e058095bc6aaa6 (MD5) en
dc.description.provenance Made available in DSpace on 2018-06-13T14:19:18Z (GMT). No. of bitstreams: 1 d'Eon_Jason_Honours_2018.pdf: 271943 bytes, checksum: 1320117e26c2730df5e058095bc6aaa6 (MD5) Previous issue date: 2018-03-29 en
dc.language.iso en en_CA
dc.publisher Halifax, N.S. : Saint Mary's University
dc.title A comparison of vertex-splitting and spider-splitting for the study of three-dimensional rigidity en_CA
dc.type Text en_CA
thesis.degree.name Bachelor of Science (Honours Mathematics)
thesis.degree.name Bachelor of Science (Honours Computing Science)
thesis.degree.level Undergraduate
thesis.degree.discipline Mathematics and Computing Science
thesis.degree.grantor Saint Mary's University (Halifax, N.S.)
 Find Full text

Files in this item

 
 

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Browse

My Account