Skip to search formSkip to main contentSkip to account menuSemantic Scholar Semantic Scholar's Logo Search 205,587,105 papers from all fields of science

Search

Semantic Scholar uses AI to extract papers important to this topic.

2019

2019

Zero forcing is a graph propagation process introduced in quantum physics and theoretical computer science, and closely related…

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…

2013

2013

The Minimum Rank Problem for Outerplanar Graphs John H. Sinkovic III Department of Mathematics, BYU Doctor of Philosophy Given a…

2012

2012

The minimum rank of a graph is the minimum possible rank of a real matrix whose zero-nonzero pattern is described by the graph…

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…

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…