Minimum-rank matrices with prescribed graph
β Scribed by Peter M. Nylen
- Book ID
- 118347580
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 752 KB
- Volume
- 248
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
The minimum rank of a simple graph G is defined to be the smallest possible rank over all symmetric real matrices whose ijth entry (for i / = j ) is nonzero whenever {i, j } is an edge in G and is zero otherwise. This paper surveys the current state of knowledge on the problem of determining the min