Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference28 articles.
1. Solving Euclidean distance matrix completion problems via semidefinite programming;Alfakih;Comput. Optim. Appl.,1999
2. An upper bound for the cardinality of an s-distance subset in real Euclidean space. II;Bannai;Combinatorica,1983
3. Topics in Algebraic Graph Theory,2004
4. Algebraic Graph Theory;Biggs,1993
5. A new upper bound for the cardinality of 2-distance sets in Euclidean space;Blokhuis,1984
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献