Abstract

Matrices are very important ingredients studies involving in linear algebra and matrix theory. The elements of a matrix can be manipulated through addition and multiplication or even be decomposed in various ways to decipher simple and intricate concepts. The matrix completion problem concentrates on interrogating and determining whether or not a completion of a partial matrix exists within a certain cluster of matrices. A desired type is arrived at by outlining descriptive characteristics and then choices for the unspecified entries made from the same set so that the matrix thereof is the desired type. Let   denote a specified class of matrices, a pattern is said to admit   completion if every partial  – matrix consistent with the pattern can be completed to a full matrix in  . In this paper, we investigate non-isomorphic digraphs with five vertices and four arcs. We have established that all associated partial matrices that are not cycles admits  -completion whereas those corresponding to cyclic digraphs do not.