Skip to Main Content
Frequently Asked Questions
Submit an ETD
Global Search Box
Need Help?
Keyword Search
Participating Institutions
Advanced Search
School Logo
Files
File List
osu1243923530.pdf (316.96 KB)
ETD Abstract Container
Abstract Header
2-arc transitive polygonal graphs of large girth and valency
Author Info
Swartz, Eric Allen
Permalink:
http://rave.ohiolink.edu/etdc/view?acc_num=osu1243923530
Abstract Details
Year and Degree
2009, Doctor of Philosophy, Ohio State University, Mathematics.
Abstract
A near-polygonal graph is a graph Γ which has a set C of m-cycles for some positive integer m such that each 2-path of Γ is contained in exactly one cycle in C. If m is the girth of Γ then the graph is called polygonal. Up until now, the only examples of 2-arc transitive polygonal graphs with arbitrarily large valency had girth no larger than seven, and the 2-arc transitive polygonal graph with largest girth had valency five and girth twenty-three (in fact, even with no restrictions on the automorphism group, there were no examples of polygonal graphs with odd girth greater than twenty-three). This thesis provides a construction of an infinite family of polygonal graphs of arbitrary girth m with 2-arc transitive automorphism groups, showing that there are 2-arc transitive polygonal graphs of arbitrarily large valency for each girth m. Furthermore, this thesis also provides a construction that, given a polygonal graph of valency r and girth m, produces a polygonal graph of valency r and girth 3m, and that the graphs constructed via this method will be 2-arc transitive if the original graph was 2-arc transitive. Finally, this thesis provides a construction of a new infinite family of near-polygonal graphs of valency 10 and a method for determining which graphs can have a given girth, which yields a few new examples of polygonal graphs.
Committee
Akos Seress, PhD (Advisor)
Boris Pittel, PhD (Committee Member)
Neil Robertson, PhD (Committee Member)
Pages
88 p.
Subject Headings
Mathematics
Keywords
graph
;
near-polygonal graph
;
polygonal graph
;
2-arc transitive
;
algebraic graph theory
Recommended Citations
Refworks
EndNote
RIS
Mendeley
Citations
Swartz, E. A. (2009).
2-arc transitive polygonal graphs of large girth and valency
[Doctoral dissertation, Ohio State University]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=osu1243923530
APA Style (7th edition)
Swartz, Eric.
2-arc transitive polygonal graphs of large girth and valency.
2009. Ohio State University, Doctoral dissertation.
OhioLINK Electronic Theses and Dissertations Center
, http://rave.ohiolink.edu/etdc/view?acc_num=osu1243923530.
MLA Style (8th edition)
Swartz, Eric. "2-arc transitive polygonal graphs of large girth and valency." Doctoral dissertation, Ohio State University, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=osu1243923530
Chicago Manual of Style (17th edition)
Abstract Footer
Document number:
osu1243923530
Download Count:
653
Copyright Info
© 2009, all rights reserved.
This open access ETD is published by The Ohio State University and OhioLINK.