# Jason Winerip

Harvey Mudd College Mathematics 2008

Thesis Proposal: | Efficient Projection of Functions on the Edge Space of Graphs |
---|---|

Thesis Final Draft: | Graph Linear Complexity |

Thesis Advisor: | Prof. Nicholas Pippenger |

Second Reader: | Prof. Michael Orrison |

## Graph Linear Complexity

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.