Matrices attaining the minimum semidefinite rank of a chordal graph

DOI10.1016/j.laa.2011.08.025zbMath1280.05082OpenAlexW1966805253MaRDI QIDQ389640

Naomi Shaked-Monderer

Publication date: 21 January 2014

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

Full work available at URL: https://doi.org/10.1016/j.laa.2011.08.025

zbMATH Keywords

chordal graphcompletely positive matrixCholesky decompositionclique covering numbercp-rank

Mathematics Subject Classification ID

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

Related Items (2)

On the number of CP factorizations of a completely positive matrix ⋮ Building a completely positive factorization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterization of completely positive graphs
• A direct proof for the matrix decomposition of chordal-structured positive semidefinite matrices
• Combinatorial results on completely positive matrices
• Positive semidefinite matrices with a given sparsity pattern
• Schur products and matrix completions
• CP rank of completely positive matrices of order 5
• Algorithmic graph theory and perfect graphs
• Extreme chordal doubly nonnegative matrices with given row sums
• Minimal CP rank
• On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
• Bipartite completely positive matrices
• Completely positive matrices associated withM-matrices

This page was built for publication: Matrices attaining the minimum semidefinite rank of a chordal graph