✦ LIBER ✦

On minimum rank and zero forcing sets of a graph

✍ Scribed by Liang-Hao Huang; Gerard J. Chang; Hong-Gwa Yeh

Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 217 KB
Volume: 432
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2010.01.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Zero forcing sets and the minimum rank o

Zero forcing sets and the minimum rank of graphs

✍ AIM Minimum Rank – Special Graphs Work Group 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 236 KB

On minimum maximal independent sets of a

On minimum maximal independent sets of a graph

✍ Julie Haviland 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 638 KB

On the minimum rank of the join of graph

On the minimum rank of the join of graphs and decomposable graphs

✍ Francesco Barioli; Shaun Fallat 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 184 KB

For a given undirected graph G, the minimum rank of G is defined to be the smallest possible rank over all real symmetric matrices A whose (i, j )th entry is nonzero whenever i / = j and {i, j } is an edge in G. In this work we consider joins and unions of graphs, and characterize the minimum rank o

Minimum rank of skew-symmetric matrices

Minimum rank of skew-symmetric matrices described by a graph

✍ IMA-ISU research group on minimum rank 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 337 KB

The minimum (symmetric) rank of a simple graph G over a field F is the smallest possible rank among all symmetric matrices over F whose ijth entry (for i / = j) is nonzero whenever {i, j} is an edge in G and is zero otherwise. The problem of determining minimum (symmetric) rank has been studied exte

On minimum sets of 1-factors covering a

On minimum sets of 1-factors covering a complete multipartite graph

✍ David Cariolaro; Hung-Lin Fu 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 132 KB 👁 1 views

## Abstract We determine necessary and sufficient conditions for a complete multipartite graph to admit a set of 1‐factors whose union is the whole graph and, when these conditions are satisfied, we determine the minimum size of such a set. © 2008 Wiley Periodicals, Inc. J Graph Theory 58:239‐250,

A note on universally optimal matrices a

A note on universally optimal matrices and field independence of the minimum rank of a graph

✍ Liang-Hao Huang; Gerard J. Chang; Hong-Gwa Yeh 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 164 KB

For a simple graph G on n vertices, the minimum rank of G over a field F, written as mr F (G), is defined to be the smallest possible rank among all n × n symmetric matrices over F whose (i, j)th entry (for i / = j) is nonzero whenever {i, j} is an edge in G and is zero otherwise. A symmetric integ