| 图是圈的完全正矩阵 |
| |
| 引用本文： | 张晓东,李炯生.图是圈的完全正矩阵[J].数学研究及应用,2000,20(1):27-31. |
| |
| 作者姓名： | 张晓东 李炯生 |
| |
| 作者单位： | 中国科学技术大学数学系,合肥 230026 |
| |
| 基金项目： | Supported by National Natural Science Foundation of China (19971086) and Special Foundation of Academic Sinica. |
| |
| 摘 要： | 本文证明，图是围的完全正矩阵Ａ当比较矩阵Ｍ（Ａ）的行列式大于零时，恰有两个极小秩１分解，而当ｄｅｔＭ（Ａ）＝０时，恰有一个极小秩１分解．
|
| 关 键 词： | 图 圈 完全正矩阵 秩 行列式 |
| 文章编号： | 1000-341(2000)01-0027-05 |
| 收稿时间： | 1997/6/23 0:00:00 |
| 修稿时间： | 1997年6月23日 |
Completely Positive Matrices Having Cyclic Graphs |
| |
| ZHANG Xiao-dong and LI Jiong-seng.Completely Positive Matrices Having Cyclic Graphs[J].Journal of Mathematical Research with Applications,2000,20(1):27-31. |
| |
| Authors: | ZHANG Xiao-dong and LI Jiong-seng |
| |
| Institution: | Dept. of Math.; University of Science and Technology of China; Hefei 230026;Dept. of Math.; University of Science and Technology of China; Hefei 230026 |
| |
| Abstract: | 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. |
| |
| Keywords: | completely positive matrix cyclic graph minimal rank 1 factorization |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《数学研究及应用》浏览原始摘要信息 |
| 点击此处可从《数学研究及应用》下载免费的PDF全文 |
