Nonchordal positive semidefinite stochastic matrices
Nonchordal positive semidefinite stochastic matrices
复制标题
非弦正半定随机矩阵
DOI:
10.1080/03081089208818155
复制
发表时间:
1992
影响因子:
1.1
通讯作者:
S. Pierce
中科院分区:
文献类型:
--
作者:
R. Grone;R. Loewy;S. Pierce
Let Kn be the convex set of n×npositive semidefinite doubly stochastic matrices. If A∊ kn , the graph of A,G(A), is the graph on n vertices with (i,j) an edge if aij ≠ 0i≠ j. We are concerned with the extreme points in Kn . In many cases, the rank of Aand G(A) are enough to determine whether A is extreme in Kn . This is true, in particular, if G(A)is a special kind of nonchordal graph, i.e., if no two cycles in G(A)have a common edge.