Open Access Senior Thesis
Bachelor of Science
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.
Winerip, Jason, "Graph Linear Complexity" (2008). HMC Senior Theses. 216.