Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
There are profound relations between the zero forcing number and minimum rank of a graph. We study the relation of both… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2016
2016
The minimum rank problem asks to find the minimum rank over all matrices with a given pattern associated with a graph. This… Expand
  • figure 1
  • figure 2
Is this relevant?
Review
2014
Review
2014
This chapter represents an overview of research related to a notion of the “rank of a graph" and the dual concept known as the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2013
2013
The Minimum Rank Problem for Outerplanar Graphs John H. Sinkovic III Department of Mathematics, BYU Doctor of Philosophy Given a… Expand
  • figure 3.1
  • figure 3.2
  • figure 4.1
  • figure 4.2
  • figure 4.3
Is this relevant?
2011
2011
Abstract In this paper we introduce a new parameter for a graph called the minimum universal rank. This parameter is similar to… Expand
  • figure 1
Is this relevant?
2010
2010
In this paper we deal with two aspects of the minimum rank of a simple undirected graph $G$ on $n$ vertices over a finite field… Expand
Is this relevant?
2008
2008
The minimum rank of a simple graph $G$ is defined to be the smallest possible rank over all symmetric real matrices whose $ij$th… Expand
Is this relevant?
2007
2007
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… Expand
Is this relevant?
1981
1981