Recommendations
Cites work
- Chromatic number and the 2-rank of a graph
- Combinatorial designs with two singular values. I: Uniform multiplicative designs
- scientific article; zbMATH DE number 540115 (Why is no real title available?)
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- Maximal graphs with respect to rank
- Maximum order of trees and bipartite graphs with a given rank
- Maximum order of triangle-free graphs with a given rank
- On graphs with multiple eigenvalues
- On order and rank of graphs
- On the existence of large sets of \(t\)-designs of prime sizes.
- ON THE MULTIPLICITIES OF GRAPH EIGENVALUES
- Spectra of graphs
- Star partitions and regularity in graphs
- The maximum order of adjacency matrices of graphs with a given rank
- The maximum order of reduced square (0,1)-matrices with a given rank
- The rank and size of graphs
Cited in
(7)- Maximum order of trees and bipartite graphs with a given rank
- Maximal graphs with respect to rank
- The maximum corank of graphs with a 2-separation
- scientific article; zbMATH DE number 5914876 (Why is no real title available?)
- Maximum order of triangle-free graphs with a given rank
- A discrete variation of the Littlewood-Offord problem
- The maximum order of adjacency matrices of graphs with a given rank
This page was built for publication: Maximum order of graphs with a given corank
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2174436)