THE M_0 – MATRIX COMPLETION PROBLEM FOR DIGRAPHS OF 5×5 MATRICES WITH LESS THAN FOUR DIRECTED LINES

Cite this:
Kinyanjui Anthony muthondu, N. J. M. B. M. S. K. (2013). THE M_0 – MATRIX COMPLETION PROBLEM FOR DIGRAPHS OF 5×5 MATRICES WITH LESS THAN FOUR DIRECTED LINES. Asian Journal of Current Engineering and Maths, 2(6). Retrieved from http://innovativejournal.in/index.php/ajcem/article/view/546
© 2022 Interactive Protocols
RIGHTS & PERMISSIONS
Article Views
143
Altmetric
1
Citations
-
LEARN ABOUT THESE METRICS
   PDF  

Abstract

A real  matrix is said to be –matrix if its principal minors are non-negative 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.

AMS Subject Classification: 0070

KEYWORDS:

 Special Issue

Article Metrics Graph

Chart Graph | Range Graph

Content

Section

Source

License

COPYRIGHT AGREEMENT AND AUTHORSHIP RESPONSIBILITY

 

All paper submissions must carry the following duly signed by all the authors:

“I certify that I have participated sufficiently in the conception and design of this work and the analysis of the data (wherever applicable), as well as the writing of the manuscript, to take public responsibility for it. I believe the manuscript represents valid work. I have reviewed the final version of the manuscript and approve it for publication. Neither has the manuscript nor one with substantially similar content under my authorship been published nor is being considered for publication elsewhere, except as described in an attachment. Furthermore I attest that I shall produce the data upon which the manuscript is based for examination by the editors or their assignees, if requested.”