On the sparsity order of a graph and its deficiency in chordality

DOI10.1007/s004930100012zbMath0989.05073OpenAlexW2084407118MaRDI QIDQ1603236

Monique Laurent

Publication date: 25 June 2002

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/11683

zbMATH Keywords

graphchordal graphsparsity order

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hermitian, skew-Hermitian, and related matrices (15B57) Structural characterization of families of graphs (05C75)

Related Items (8)

Multivariate Gaussians, semidefinite matrix completion, and convex algebraic geometry ⋮ Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without \(K_{5}\) minors ⋮ Do Sums of Squares Dream of Free Resolutions? ⋮ Graphs with sparsity order at most two: the complex case ⋮ Maximum likelihood threshold and generic completion rank of graphs ⋮ A direct proof for the matrix decomposition of chordal-structured positive semidefinite matrices ⋮ Asymptotic Bayesian structure learning using graph supports for Gaussian graphical models ⋮ Spectrahedral cones generated by rank \(1\) matrices

This page was built for publication: On the sparsity order of a graph and its deficiency in chordality