✦ LIBER ✦

A new lower bound for the positive semidefinite minimum rank of a graph

✍ Scribed by Andrew M. Zimmer

Book ID: 119317704
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 392 KB
Volume: 438
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2012.09.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Minimum Rank Among Positive Semid

On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph

✍ Booth, Matthew; Hackney, Philip; Harris, Benjamin; Johnson, Charles R.; Lay, Mar 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 152 KB

The minimum semidefinite rank of a trian

The minimum semidefinite rank of a triangle-free graph

✍ Louis Deaett 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 247 KB

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

Lower bound of the sum of positive eigen

Lower bound of the sum of positive eigenvalues of a graph

✍ Li Jiongsheng; Wang Xinmao 📂 Article 📅 1998 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 190 KB

Lower bound of the sum of positive eigen

Lower bound of the sum of positive eigenvalues of a graph

✍ Li Jiongsheng; Wang Xinmao 📂 Article 📅 1998 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 190 KB

A lower bound for the circumference of a

A lower bound for the circumference of a graph

✍ Nathan Linial 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 423 KB

Lrzt G = (V, 0 be a ttlock :.>f order n, different from Kn. Let ~FI = min {d(x) + d(y): n then G contains a cycle of length at least m. 1. Introductlion and notatio e discuss only finite undirected graphs withsLc loops and multiple edges. We p:rosye the main theorem d show how Qre's th -orem [ 3.1 o