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.
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
Scholarship @ Claremont
2008
|
| Subjects: | |
| Online Access: | https://scholarship.claremont.edu/hmc_theses/216 https://scholarship.claremont.edu/cgi/viewcontent.cgi?article=1219&context=hmc_theses |