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.

• Type: Journal
• Year: 2006
• Where: COMBINATORICS
• Authors: David L. Neel, Michael E. Orrison
• Keywords: COMBINATORICS 2006, Linear Complexity, Matrix, Scalar Multiplications