The minimum rank of symmetric matrices described by a graph: A survey☆
The minimum rank of symmetric matrices described by a graph: A survey☆
复制标题
DOI：
10.1016/j.laa.2007.05.036
复制
发表时间：
2007-10
影响因子：
1.1
通讯作者：
Shaun M. Fallat;L. Hogben
中科院分区：
文献类型：
--
作者：
Shaun M. Fallat;L. Hogben
简单图 G 的最小秩被定义为所有对称实矩阵的最小可能秩，只要 {i,j} 是 G 中的边，其第 ij 个条目（对于 i≠j）就非零，否则为零。本文调查了确定图的最小秩问题及相关问题的当前知识状况。
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 minimum rank of a graph and related issues.