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

This book provides an introduction to the inverse eigenvalue problem for graphs (IEP-$ G $)
and the related area of zero forcing, propagation, and throttling. The IEP-$ G $ grew from the …

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 …

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 …

Zero forcing is a graph coloring process based on the following color change rule: all
vertices of a graph G are initially colored either blue or white; in each timestep, a white …

The minimum rank of a graph has been an interesting and well studied parameter
investigated by many researchers over the past decade or so. One of the many unresolved …

There are profound relations between the zero forcing number and minimum rank of a
graph. We study the relation of both parameters with a third one, the algebraic co-rank …

The (disjoint) fort number and fractional zero forcing number are introduced and related to
existing parameters including the (standard) zero forcing number. The fort hypergraph is …

In this paper we introduce a class of regular bipartite graphs whose biadjacency matrices
are circulant matrices–a generalization of circulant graphs which happen to be bipartite–and …