The minimum rank problem for a (simple) graph $ G $ is to determine the smallest possible
rank over all real symmetric matrices whose $ ij $ th entry (for $ i\neq j $) is nonzero …

The minimum rank of a directed graph G is defined to be the smallest possible rank over all
real matrices whose ijth entry is nonzero whenever (i, j) is an arc in G and is zero otherwise …

The minimum rank of a graph G is the minimum of the ranks of all symmetric adjacency
matrices of G. We present a new combinatorial bound for the minimum rank of an arbitrary …

Given a graph G, the zero forcing number of G, Z (G), is the smallest cardinality of any set S
of vertices on which repeated applications of the color change rule results in all vertices …

The minimum rank of a simple graph G is defined to be the smallest possible rank over all
symmetric real matrices whose ijth entry (for i≠ j) is nonzero whenever {i, j} is an edge in G …

The minimum rank of a simple graph G is defined to be the smallest possible rank over all
symmetric real matrices whose i j-th entry (for i≠ j) is nonzero whenever {i, j} is an edge in G …

The minimum rank of a graph G is the minimum rank over all real symmetric matrices whose
off-diagonal sparsity pattern is the same as that of the adjacency matrix of G. In this note we …

In the finite-time average consensus problem, the goal is to make the agents meet at the
average of their initial positions in a finite number of steps, with the constraint that each …

The minimum rank problem of a graph G is to determine the smallest rank over all real
symmetric matrices whose ij-entry, i≠ j, is nonzero whenever ij is an edge and is zero …

The minimum rank of a simple graph G is defined to be the smallest possible rank over all
symmetric real matrices whose ij-th entry (for i= j) is nonzero whenever {i, j} is an edge in G …