Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

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

2019

2019

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

2018

2018

Let F be a field, let G be a simple graph on n vertices, and let S (G) be the class of all F -valued symmetric n × n matrices… Expand

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

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

2013

2013

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

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

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

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

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