The linear complexity of a graph.
Neel, David L. ; Orrison, Michael E.
The Electronic Journal of Combinatorics [electronic only], Tome 13 (2006), / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 2006-01-01
EUDML-ID : urn:eudml:doc:125526 
@article{05005203,
     title = {The linear complexity of a graph.},
     journal = {The Electronic Journal of Combinatorics [electronic only]},
     volume = {13},
     year = {2006},
     zbl = {1080.05092},
     language = {en},
     url = {http://dml.mathdoc.fr/item/05005203}
}

Neel, David L.; Orrison, Michael E. The linear complexity of a graph.. The Electronic Journal of Combinatorics [electronic only], Tome 13 (2006) . http://gdmltest.u-ga.fr/item/05005203/