Completely Positive Matrices Having Cyclic Graphs
Received:June 23, 1997  
Key Words: completely positive matrix   cyclic graph   minimal rank 1 factorization.  
Fund Project:Supported by National Natural Science Foundation of China(19971086) and Special Foundation of Academic Sinica.
Author NameAffiliation
ZHANG Xiao-dong Dept. of Math.
University of Science and Technology of China
Hefei 230026 
LI Jiong-seng Dept. of Math.
University of Science and Technology of China
Hefei 230026 
Hits: 2116
Download times: 1246
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.
Citation:
DOI:10.3770/j.issn:1000-341X.2000.01.003
View Full Text  View/Add Comment  
  Copyright © Journal of Mathematical Research with Applications
Sponsored by：Dalian University of Technology, China Society for Industrial and Applied Mathematics
Address：No.2 Linggong Road, Ganjingzi District, Dalian City, Liaoning Province, P. R. China , Postal code ：116024
Service Tel：86-411-84707392 Email：jmre@dlut.edu.cn
Designed by Beijing E-tiller Co.,Ltd.
Due to security factors, early browsers cannot log in. It is recommended to log in with IE10, IE11, Google, Firefox, and 360 new browsers.