Graphs with sparsity order at most two: the complex case

DOI10.1080/03081087.2016.1274362zbMath1381.05060arXiv1804.08931OpenAlexW2568259186MaRDI QIDQ4603775

E. M. Klem, Sanne ter Horst

Publication date: 19 February 2018

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

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

zbMATH Keywords

forbidden subgraphssparsity ordermatrix cones

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) Convex sets and cones of operators (47L07)

Cites Work

• Unnamed Item
• Unnamed Item
• On rigid circuit graphs
• Positive definite completions of partial Hermitian matrices
• A non-existence result on cyclic cycle-decompositions of the cocktail party graph
• Clique partitions of the cocktail party graph
• Positive semidefinite matrices with a given sparsity pattern
• On the sparsity order of a graph and its deficiency in chordality
• The Ranks of Extremal Positive Semidefinite Matrices with Given Sparsity Pattern
• Graph Classes: A Survey
• Dihedral Hamiltonian Cycle Systems of the Cocktail Party Graph
• Axiomatic Characterization of the Median and Antimedian Functions on Cocktail-Party Graphs and Complete Graphs
• On Majorization, Factorization, and Range Inclusion of Operators on Hilbert Space