Journal or Book Title
Electronic Journal of Linear Algebra
In this paper the P0-matrix completion problem is considered. It is established that every asymmetric partial P0-matrix has P0-completion. All 4 × 4 patterns that include all diagonal positions are classified as either having P0-completion or not having P0-completion. It is shown that any positionally symmetric pattern whose graph is an n-cycle with n ≥ 5 has P0-completion.
Choi, Ji Young; DeAlba, Luz Maria; Hogben, Leslie; Maxwell, Mandi S.; and Wangsness, Amy, "The P0-matrix completion problem" (2002). Mathematics Publications. 253.