Skip to search formSkip to main contentSkip to account menu

Minimum rank of a graph

In mathematics, the minimum rank is a graph parameter for any graph G. It was motivated by the Colin de Verdière's invariant.
Wikipedia (opens in a new tab)

Related topics

Related topics

9 relations
Adjacency matrixColin de Verdière graph invariantConnected component (graph theory)Graph (discrete mathematics)

Broader (1)

Algebraic graph theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Maximum nullity and zero forcing of circulant graphs
Abstract The zero forcing number of a graph has been applied to communication complexity, electrical power grid monitoring, and… 
2018
2018
Diagonal entry restrictions in minimum rank matrices Wayne
Let F be a field, let G be a simple graph on n vertices, and let S (G) be the class of all F -valued symmetric n × n matrices… 
2015
2015
On the minimum rank of certain graphs with path cover number 2
The minimum rank problem is an interesting and ongoing problem in spectral graph theory which seeks to answer the question "Given… 
2013
2013
The Minimum Rank Problem for Outerplanar Graphs
The Minimum Rank Problem for Outerplanar Graphs John H. Sinkovic III Department of Mathematics, BYU Doctor of Philosophy Given a… 
2012
2012
Computing the minimum rank of a loop directed tree
The minimum rank of a graph is the minimum possible rank of a real matrix whose zero-nonzero pattern is described by the graph… 
2007
2007
Minimum rank of a graph over an arbitrary field
For a field F and graph G of order n, the minimum rank of G over F is defined to be the smallest possible rank over all symmetric… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)