✦ LIBER ✦

Orthogonal representations, minimum rank, and graph complements

✍ Scribed by Leslie Hogben

Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 134 KB
Volume: 428
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2007.12.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the graph complement conjecture for m

On the graph complement conjecture for minimum semidefinite rank

✍ Lon H. Mitchell 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 158 KB

Representations of graphs and orthogonal

Representations of graphs and orthogonal latin square graphs

✍ Paul Erdös; Anthony B. Evans 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB

The minimum rank of matrices and the equ

The minimum rank of matrices and the equivalence class graph

✍ Rosàrio Fernandes; Cecı´lia Perdigão 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 208 KB

On minimum rank and zero forcing sets of

On minimum rank and zero forcing sets of a graph

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

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