Research problem: The completion number of a graph

DOI10.1080/03081080410001723840MaRDI QIDQ5462823zbMATH OpenOpenAlexFDO

Authors Mihai Bakonyi, T. 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)

Abstract: Motivated by the remarkable interplay between (chordal) graphs and matrix algebra, we associate to each graph a so-called completion number that might encode some aspects of that interplay. We show that this number is not trivial, and we ask for a graph theoretic characterization of those graphs with a given completion number.

Recommendations

• Matrix completions and chordal graphs
• Graph theoretic methods for matrix completion problems
• Matrix completion problems
• scientific article; zbMATH DE number 523915
• Completions of partial Jordan and Hessenberg matrices

Cites work

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5462823)