The Characterization Of Graphs With Small Bicycle Spectrum

Matroids designs are defined to be matroids in which the hyperplanes all have the same size. The dual of a matroid design is a matroid with all circuits of the same size, called a dual matroid design. The connected bicircular dual matroid designs have been characterized previously. In addition, these results have been extended to connected bicircular matroids with circuits of two sizes in the case that the associated graph is a subdivision of a 3-connected graph. In this dissertation, we will use a graph theoretic approach to discuss the characterizations of bicircular matroids with circuits of two and three sizes. We will characterize the associated graph of a bicircular matroid with circuits of two sizes. Moreover, we will provide a characterization of connected bicircular matroids with circuits of three sizes in the case that the associated graph is a subdivision of a 3-connected graph. We will also investigate the circuit spectrum of bicircular matroids whose associated graphs have minimum degree at least i for k ≥ 1, and show that there exists a set of bicycles with consecutive bicycle lengths.

Name thesis:degree_name

Ph.D. in Mathematics

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Mathematics

Year dc:date.available

2014

Author dc:creator

• Putnam, Bette Catherine

Contributors dc:contributor

• Laura Sheppardson
• Jason D. Hoeksema
• Talmadge James Reid

• Bicycle
• Spectrum
• Mathematics

Repository record dc:identifier

https://egrove.olemiss.edu/etd/681

OAI identifier oai:identifier

oai:egrove.olemiss.edu:etd-1680