The linear complexity of a graph (Q813437)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5005203
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The linear complexity of a graph |
scientific article; zbMATH DE number 5005203 |
Statements
The linear complexity of a graph (English)
0 references
9 February 2006
0 references
Summary: 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.
0 references
adjacency matrices
0 references
0.77034991979599
0 references
0.747697114944458
0 references
0.7272858619689941
0 references
0.7215137481689453
0 references
