The – matrix completion problem for digraphs of matrices with less than four directed lines
| dc.contributor.author | Kivunge, B. | |
| dc.contributor.author | Muondwe, S.K. | |
| dc.contributor.author | Njoroge, James Mwangi | |
| dc.contributor.author | Kinyanjui, Anthony muthondu | |
| dc.date.accessioned | 2015-02-17T12:46:04Z | |
| dc.date.available | 2015-02-17T12:46:04Z | |
| dc.date.issued | 2013 | |
| dc.description.abstract | A real matrix is said to be –matrix if its principal minors are nonnegative and all its non-diagonal entries are non-positive. In this project, we consider the –matrix completion problem. It is shown that any digraph with less than four directed lines which is not a cycle has –completion. It is further shown that digraph of matrix with less than four directed lines which is a cycle does not have –completion | en_US |
| dc.identifier.citation | Asian Journal of Current Engineering and Maths 2: 6 Nov – Dec (2013) 374 - 390 | en_US |
| dc.identifier.issn | 2277-4920 | |
| dc.identifier.uri | http://www.innovativejournal.in/index.php/ajcem/article/view/546/506 | |
| dc.identifier.uri | http://ir-library.ku.ac.ke/handle/123456789/12251 | |
| dc.language.iso | en | en_US |
| dc.publisher | Innovative Journal | en_US |
| dc.title | The – matrix completion problem for digraphs of matrices with less than four directed lines | en_US |
| dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- The – matrix completion problem for digraphs of matrices with less than four directed lines.pdf
- Size:
- 1.23 MB
- Format:
- Adobe Portable Document Format
- Description:
- Full text
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed upon to submission
- Description: