Sciweavers

Share
COMBINATORICS
2006

The Linear Complexity of a Graph

8 years 11 months ago
The Linear Complexity of a Graph
The linear complexity of a matrix is a measure of the number of additions, subtractions, and scalar multiplications required to multiply that matrix and an arbitrary vector. In this paper, we define the linear complexity of a graph to be the linear complexity of any one of its associated adjacency matrices. We then compute or give upper bounds for the linear complexity of several classes of graphs.
David L. Neel, Michael E. Orrison
Added 11 Dec 2010
Updated 11 Dec 2010
Type Journal
Year 2006
Where COMBINATORICS
Authors David L. Neel, Michael E. Orrison
Comments (0)
books