Research problem: The completion number of a graph

DOI10.1080/03081080410001723840zbMath1065.05061arXivmath/0312390OpenAlexW2000240244MaRDI QIDQ5462823

Mihai Bakonyi, Tiberiu Constantinescu

Publication date: 27 July 2005

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0312390

zbMATH Keywords

characterizationmatrix analysis

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Positive matrices and their generalizations; cones of matrices (15B48)

Cites Work

• Positive definite completions of partial Hermitian matrices
• Positive semidefinite matrices with a given sparsity pattern
• Extensions of band matrices with band inverses
• Rank decomposability in incident spaces
• Inertia possibilities for completions of partial hermitian matrices^*
• The Ranks of Extremal Positive Semidefinite Matrices with Given Sparsity Pattern
• Sparsity Patterns with High Rank Extremal Positive Semidefinite Matrices

This page was built for publication: Research problem: The completion number of a graph