The Handbook of Linear Algebra provides comprehensive coverage of linear algebra
concepts, applications, and computational software packages in an easy-to-use handbook …

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 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 …

For a graph G on n vertices and a field F, the minimum rank of G over F, written as mrF (G), is
the smallest possible rank over all n× n symmetric matrices over F whose (i, j) th entry (for i≠ …

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 …

Any finite simple graph $ G=(V, E) $ can be represented by a collection $\mathscr {C} $ of
subsets of $ V $ such that $ uv\in E $ if and only if $ u $ and $ v $ appear together in an odd …

Let G be an undirected graph on n vertices and let S (G) be the set of all real symmetric n× n
matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to …

The zero forcing number is a graph parameter first introduced as a tool for solving the
minimum rank problem, which is: Given a simple, undirected graph G, and a field F, let S (F …

Reaction networks are a powerful tool for modeling the behavior of a wide variety of real-
world systems, including population dynamics and chemical processes, as well as …

The minimum (maximum) skew-rank of a simple graph G over real field is the smallest
(largest) possible rank among all skew-symmetric matrices over real field whose ij-th entry is …