期刊文献+

Completely Positive Matrices Having Cyclic Graphs

图是圈的完全正矩阵(英文)
下载PDF
导出
摘要 We prove that a CP matrix A having cyclic graph has exactly two minimal rank 1 factorization if det M(A) > 0 and has exactly one minimal rank 1 factorization if detM(A) = 0. 本文证明,图是围的完全正矩阵A当比较矩阵M(A)的行列式大于零时,恰有两个极小秩1分解,而当detM(A)=0时,恰有一个极小秩1分解.
出处 《Journal of Mathematical Research and Exposition》 CSCD 2000年第1期27-31,共5页 数学研究与评论(英文版)
关键词 completely positive matrix cyclic graph minimal rank 1 factorization. 完全正矩阵 行列式
  • 相关文献

参考文献4

  • 1[1]BERMAN A and KOGAN N. Characterization of completely positive graphs [J]. Discrete Mathematics, 1993, 114:297-304.
  • 2[2]BERMAN A and PLEMMONS R. Nonnegative Matrices in the Mathematical Science [M].2nd ed., Academic, New York, 1994.
  • 3[3]DREW J H, JOHNSON C R and LOEWY R. Completely positive matrices associated with M-matrices [J]. Linear and Multilinear Algebra, 1994, 37: 303-310.
  • 4[4]MINC H. Nonnegative Matrices [M]. John Wiley and Sons, New York, 1988.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部