Geodesic
The rank of a cograph
The electronic journal of combinatorics, Tome 10 (2003)

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl EuDML
The rank of the adjacency matrix of a graph is bounded above by the number of distinct non-zero rows of that matrix. In general, the rank is lower than this number because there may be some non-trivial linear combination of the rows equal to zero. We show the somewhat surprising result that this never occurs for the class of cographs. Therefore, the rank of a cograph is equal to the number of distinct non-zero rows of its adjacency matrix.
DOI : 10.37236/1751
Classification : 05C50
Mots-clés : adjacency matrix 
Gordon F. Royle. The rank of a cograph. The electronic journal of combinatorics, Tome 10 (2003). doi: 10.37236/1751
@article{10_37236_1751,
     author = {Gordon F. Royle},
     title = {The rank of a cograph},
     journal = {The electronic journal of combinatorics},
     year = {2003},
     volume = {10},
     doi = {10.37236/1751},
     zbl = {1024.05058},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1751/}
}
TY  - JOUR
AU  - Gordon F. Royle
TI  - The rank of a cograph
JO  - The electronic journal of combinatorics
PY  - 2003
VL  - 10
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1751/
DO  - 10.37236/1751
ID  - 10_37236_1751
ER  - 
%0 Journal Article
%A Gordon F. Royle
%T The rank of a cograph
%J The electronic journal of combinatorics
%D 2003
%V 10
%U http://geodesic.mathdoc.fr/articles/10.37236/1751/
%R 10.37236/1751
%F 10_37236_1751

Cité par Sources :