The doubly negative matrix completion problem (Q1779397)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The doubly negative matrix completion problem |
scientific article; zbMATH DE number 2173153
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The doubly negative matrix completion problem |
scientific article; zbMATH DE number 2173153 |
Statements
The doubly negative matrix completion problem (English)
0 references
1 June 2005
0 references
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.
0 references
partial matrix
0 references
matrix completion problem
0 references
double negative matrix
0 references
undirected graph
0 references
