Minimum rank of a graph over an arbitrary field

DOI10.13001/1081-3810.1193MaRDI QIDQ3497884zbMATH OpenOpenAlexFDO

Authors Nathan Chenette, Sean V. Droms, Rana Mikkelson, Olga Pryporova, 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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

fieldgraphminimum rankpathsymmetric matrixtree

Mathematics Subject Classification ID

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

Recommendations

• Minimum rank of powers of trees
• Minimum-rank matrices with prescribed graph
• Graphs whose minimal rank is two: The finite fields case
• An upper bound for the minimum rank of a graph
• On minimal rank over finite fields

Cited in

(11)

• Subgraph complementation and minimum rank
• Critical ideals, minimum rank and zero forcing number
• 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
• Minimum rank of powers of trees
• Universally optimal matrices and field independence of the minimum rank of a graph
• On the minimum rank of the third power of a starlike tree
• An upper bound for the minimum rank of a graph
• The minimum rank of symmetric matrices described by a graph: a survey
• The minimum rank problem over the finite field of order 2: Minimum rank 3

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3497884)