The nonnegative P_0-matrix completion problem

Main Article Content

Ji Young Choi
Luz Maria DeAlba
Leslie Hogben
Benard M. Kivunge
Sandra K. Nordstrom
Mike Shedenhelm

Abstract

In this paperthe nonnegative P0-matrix completion problem is considered. It is
shown that a pattern for 4 × 4 matrices that includes all diagonal positions has nonnegative P0-completion if and only if its digraph is complete when it has a 4-cycle. It is also shown that any positionally symmetric pattern that includes all diagonal positions and whose graph is an n-cycle has nonnegative P0-completion if and only if n = 4. 

Article Details

Section
Article

Most read articles by the same author(s)

1 2 3 > >>