Minimum rank of a graph over an arbitrary field

DOI10.13001/1081-3810.1193zbMath1142.05335OpenAlexW782041273MaRDI QIDQ3497884

Nathan Chenette, Olga Pryporova, Sean V. Droms, Rana Mikkelson, Leslie Hogben

Publication date: 28 May 2008

Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/129117

zbMATH Keywords

treegraphpathsymmetric matrixfieldminimum rank

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (6)

Subgraph complementation and minimum rank ⋮ The maximum corank of graphs with a 2-separation ⋮ Zero forcing sets and the minimum rank of graphs ⋮ Trees and acyclic matrices over arbitrary fields ⋮ Critical ideals, minimum rank and zero forcing number ⋮ The minimum rank of symmetric matrices described by a graph: a survey

This page was built for publication: Minimum rank of a graph over an arbitrary field