On the minimum rank of a graph over finite fields

DOI10.1016/j.laa.2011.06.041zbMath1241.05078arXiv1006.0770OpenAlexW2962808515MaRDI QIDQ765180

Shmuel Friedland, Raphael Loewy

Publication date: 19 March 2012

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1006.0770

zbMATH Keywords

finite fieldcliquematrixminimum rankscaled average minmum rank

Mathematics Subject Classification ID

Finite fields and commutative rings (number-theoretic aspects) (11T99) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vector spaces, linear dependence, rank, lineability (15A03)

Related Items (2)

Subgraph complementation and minimum rank ⋮ On zero forcing number of graphs and their complements

Cites Work

• Unnamed Item
• Quadratic forms and the graph isomorphism problem
• Expected values of parameters associated with the minimum rank of a graph
• The minimum rank problem over the finite field of order 2: Minimum rank 3
• On Fiedler's characterization of tridiagonal matrices over arbitrary fields
• A characterization of tridiagonal matrices
• The graphs for which the maximum multiplicity of an eigenvalue is two
• Graphs whose minimal rank is two: The finite fields case
• Orthogonal Matrices Over Finite Fields

This page was built for publication: On the minimum rank of a graph over finite fields