Expected values of parameters associated with the minimum rank of a graph
DOI10.1016/j.laa.2010.01.036zbMath1217.05142arXiv1605.05692OpenAlexW1966863811MaRDI QIDQ972786
Leslie Hogben, H. Tracy Hall, Ryan R. Martin, Bryan L. Shader
Publication date: 21 May 2010
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.05692
graphrankexpected valuerandom graphmatrixminimum rankColin de Verdière type parametermaximum nullitypositive semidefinite minimum rankdelta conjectureaverage maximum nullityaverage minimum rank
Random graphs (graph-theoretic aspects) (05C80) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vector spaces, linear dependence, rank, lineability (15A03)
Related Items (11)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Three-connected graphs whose maximum nullity is at most three
- An upper bound for the minimum rank of a graph
- The minimum rank of symmetric matrices described by a graph: a survey
- Sharp concentration of the chromatic number on random graphs \(G_{n,p}\)
- Degree sequences of random graphs
- On the relation between two minor-monotone graph parameters
- Multiplicities of eigenvalues and tree-width of graphs
- A correction: Orthogonal representations and connectivity of graphs
- Orthogonal representations and connectivity of graphs
- On the number of zero-patterns of a sequence of polynomials
- Paths in graphs
- A variant on the graph parameters of Colin de Verdiere: Implications to the minimum rank of graphs
This page was built for publication: Expected values of parameters associated with the minimum rank of a graph