Graduation Year
2008
Document Type
Open Access Senior Thesis
Degree Name
Bachelor of Science
Department
Mathematics
Reader 1
Nicholas Pippenger
Reader 2
Michael Orrison
Abstract
This thesis expands on the notion of linear complexity for a graph as defined by Michael Orrison and David Neel in their paper "The Linear Complexity of a Graph." It considers additional classes of graphs and provides upper bounds for additional types of graphs and graph operations.
Recommended Citation
Winerip, Jason, "Graph Linear Complexity" (2008). HMC Senior Theses. 216.
https://scholarship.claremont.edu/hmc_theses/216
COinS
