Geodesic
The linear complexity of a graph
The electronic journal of combinatorics, Tome 13 (2006)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/1035
Classification : 05C85, 68R10, 05C50
Mots-clés : adjacency matrices 
@article{10_37236_1035,
     author = {David L. Neel and Michael E. Orrison},
     title = {The linear complexity of a graph},
     journal = {The electronic journal of combinatorics},
     year = {2006},
     volume = {13},
     doi = {10.37236/1035},
     zbl = {1080.05092},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1035/}
}
TY  - JOUR
AU  - David L. Neel
AU  - Michael E. Orrison
TI  - The linear complexity of a graph
JO  - The electronic journal of combinatorics
PY  - 2006
VL  - 13
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1035/
DO  - 10.37236/1035
ID  - 10_37236_1035
ER  - 
%0 Journal Article
%A David L. Neel
%A Michael E. Orrison
%T The linear complexity of a graph
%J The electronic journal of combinatorics
%D 2006
%V 13
%U http://geodesic.mathdoc.fr/articles/10.37236/1035/
%R 10.37236/1035
%F 10_37236_1035
David L. Neel; Michael E. Orrison. The linear complexity of a graph. The electronic journal of combinatorics, Tome 13 (2006). doi: 10.37236/1035

Cité par Sources :