The rank of a cograph (Q1408552): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 16:30, 31 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The rank of a cograph |
scientific article |
Statements
The rank of a cograph (English)
0 references
24 September 2003
0 references
Summary: 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.
0 references
adjacency matrix
0 references