The linear complexity of a graph.
Neel, David L.; Orrison, Michael E.
The Electronic Journal of Combinatorics [electronic only] (2006)
- Volume: 13, Issue: 1, page Research paper R9, 19 p.-Research paper R9, 19 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topNeel, David L., and Orrison, Michael E.. "The linear complexity of a graph.." The Electronic Journal of Combinatorics [electronic only] 13.1 (2006): Research paper R9, 19 p.-Research paper R9, 19 p.. <http://eudml.org/doc/125526>.
@article{Neel2006,
author = {Neel, David L., Orrison, Michael E.},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {adjacency matrices},
language = {eng},
number = {1},
pages = {Research paper R9, 19 p.-Research paper R9, 19 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {The linear complexity of a graph.},
url = {http://eudml.org/doc/125526},
volume = {13},
year = {2006},
}
TY - JOUR
AU - Neel, David L.
AU - Orrison, Michael E.
TI - The linear complexity of a graph.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2006
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 13
IS - 1
SP - Research paper R9, 19 p.
EP - Research paper R9, 19 p.
LA - eng
KW - adjacency matrices
UR - http://eudml.org/doc/125526
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.