๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the graph complement conjecture for minimum semidefinite rank

โœ Scribed by Lon H. Mitchell

Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
158 KB
Volume
435
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An upper bound for the minimum rank of a
An upper bound for the minimum rank of a graph
โœ Avi Berman; Shmuel Friedland; Leslie Hogben; Uriel G. Rothblum; Bryan Shader ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 137 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

A minimum principle and estimates of the
A minimum principle and estimates of the eigenvalues for schur complements positive semidefinite hermitian matrices
โœ Jianzhou Liu; Li Zhu ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 536 KB

We give a minimum principle for Sehur complements of positive definite Herrnitian matrices. Further, we obtain some inequalities for the eigenvalues of Schur complements of products and sums of positive definite Hermitian matrices.