The rank of a cograph (Q1408552)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The rank of a cograph |
scientific article; zbMATH DE number 1985386
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The rank of a cograph |
scientific article; zbMATH DE number 1985386 |
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
0 references
0 references
0 references
0 references
0 references
0.8842381
0 references
