Graph cores via universal completability

DOI10.1016/j.endm.2015.06.046zbMath1346.05195OpenAlexW2177515002MaRDI QIDQ322258

Robert Šámal, Antonios Varvitsiotis, Brendan Rooney, David E. Roberson, Chris D. Godsil

Publication date: 14 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2015.06.046

zbMATH Keywords

graph coresuniversal completabilityuniversal rigidity

Mathematics Subject Classification ID

Graph minors (05C83) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

Universal completability, least eigenvalue frameworks, and vector colorings ⋮ The core of a complementary prism

Cites Work

• Unnamed Item
• Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope
• A new graph parameter related to bounded rank positive semidefinite matrix completions
• Positive semidefinite matrix completion, universal rigidity and the strong Arnold property
• Homomorphisms of derivative graphs

This page was built for publication: Graph cores via universal completability