The Wss P0 Matrix Completion Problem for Symmetric Patterns of Acyclic Digraphs of Order Four
Abstract
In this paper we study weakly sign symmetric Wss P_{0}matrix specifying symmetric patterns of acyclic digraphs of 4 vertices where necessary and sufficient conditions for a digraphs to have weakly sign symmetric P_{0}matrix completion are stated and discussed. It is shown that all symmetric patterns specifying acyclic digraphs of order 4 with without an arc, 2 arcs and regular digraphs with 4 arcs have zero completion to weakly sign symmetric P_{0}matrix.
Keywords
Full Text:
PDFReferences
J.Y. Choi, L.M. Dealba, L. Hogben, M. Maxwell. “The Matrix Completion Problem.” Electronic Journal of Linear Algebra, Vol. 9, PP. 120, 2002.
L. M. DeAlba, T.L. Hardy, L. Hogben and A. Wangsness. “The (Weakly) Sign Symmetric matrix Completion Problems.” Electronic Journal of Linear Algebra, Vol. 10, PP. 257271, 2003.
F. Harary. Graph Theory; New York; AddisonWesley Publishing Company, 1969.
J.Y. Choi, L.M. Dealba, L. Hogben, B.M. Kivunge, S.K. Nordstrom and M. Shedenhelm. “The Nonnegative Matrix Completion Problem.” Electronic Journal of Linear Algebra, Vol. 10, PP. 4659, 2003
L. Hogben. “Graph Theoretic Methods of Matrix Completion Problem.” Linear Algebra and its Applications, Vol. 328, PP. 161202, 2001.
L. Hogben. “Matrix Completion Problems for pairs of related classes of matrices.” Linear Algebra and its Applications, Vol. 373, PP.1329, 2003
Refbacks
 There are currently no refbacks.
