The doubly negative matrix completion problem (Q1779397)

This paper deals with the types of graphs assuring the existence of doubly negative matrix completions of partial doubly negative matrices of order \(n\). It is shown that every partial doubly negative matrix whose associated graph is a \(p\)-chordal graph has a doubly negative matrix completion if and only if \(p\) = 1. In the case of partial doubly negative matrices whose associated graph is a cycle some sufficient conditions for the existence of the desired completion are presented.