zbMATH — the first resource for mathematics

The rank of a cograph. (English) Zbl 1024.05058
Electron. J. Comb. 10, Research paper N11, 7 p. (2003); printed version J. Comb. 10, No. 4 (2003).
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.

05C50 Graphs and linear algebra (matrices, eigenvalues, etc.)
Full Text: EuDML EMIS