## Abstract

The maximum order of a square (0, 1)-matrix

1996.] proved that the maximum order equals Θ

*A*with a fixed rank*r*is considered, provided A has no repeated rows or columns. When A is the adjacency matrix of a graph, Kotlov and Lovász [A. Kotlov and L. Lovász. The rank and size of graphs. J. Graph Theory, 23:185–189,1996.] proved that the maximum order equals Θ

^{(2r/2)}. In this note, it is showed that this result remains correct if*A*is symmetric, but becomes false if symmetry is not required.Original language | English |
---|---|

Pages (from-to) | 3-6 |

Journal | Electronic Journal of Linear Algebra |

Volume | 24 |

Publication status | Published - 2012 |