The Q0-matrix completion problem

Abstract

A matrix is a Q0-matrix if for every k∈{1,2,…,n}, the sum of all k×k principal minors is nonnegative. In this paper, we study some necessary and sufficient conditions for a digraph to have Q0-completion. Later on we discuss the relationship between Q and Q0-matrix completion problem. Finally, a classification of the digraphs of order up to four is done based on Q0-completion.