Abstract
The Euclidean distance matrix completion problem asks when a partial distance matrix has a distance matrix completion, in the event that the graph of the specified data is chordal no additional information is needed. If the graph is not chordal, more must be known about the data. In the event the data comprises a full cycle, the additional are quite simple. We characterize those graphs such that the cycle conditions on all minimal cycles imply that a partial distance matrix has a distance matrix completion. One description of these graphs is that they have chordal supergraphs in which no 4-clique includes an added edge, the same condition that appeared in the corresponding question about positive definite completions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
