The Euclidean distance completion problem: cycle completability

DOI10.1080/03081089508818392zbMath0833.05061OpenAlexW2073539813MaRDI QIDQ4853938

Charles R. Johnson, Brenda K. Kroschel, Catherine A. Jones

Publication date: 20 February 1996

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

Full work available at URL: https://doi.org/10.1080/03081089508818392

zbMATH Keywords

cyclespartial symmetric matrixcycle completabilityEuclidean distance matrix completion problempartial distance matrix

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

Connections between the real positive semidefinite and distance matrix completion problems, Cuts, matrix completions and graph rigidity, A connection between positive semidefinite and Euclidean distance matrix completion problems, Structural conditions for cycle completable graphs, On the uniqueness of Euclidean distance matrix completions., Characterizing and generalizing cycle completable graphs, On the uniqueness of Euclidean distance matrix completions: the case of points in general position, The symmetric inverse \(M\)-matrix completion problem

Cites Work

• Unnamed Item
• Unnamed Item
• Positive definite completions of partial Hermitian matrices
• The real positive definite completion problem for a simple cycle
• Connections between the real positive semidefinite and distance matrix completion problems