Minimal Euclidean representations of graphs
Author:
- Aidan RoyARAidan Roy
- 1 February 2010
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 310 (4) , 727-733
Abstract
No abstract availableKeywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Spectra of random graphs with given expected degreesProceedings of the National Academy of Sciences, 2003
- Solving Euclidean Distance Matrix Completion Problems Via Semidefinite Programming1999
- New Maximal Two-Distance SetsJournal of Combinatorial Theory, Series A, 1997
- The cone of distance matricesLinear Algebra and its Applications, 1991
- Developments in the theory of graph spectraLinear and Multilinear Algebra, 1985
- Properties of Euclidean and non-Euclidean distance matricesLinear Algebra and its Applications, 1985
- An upper bound for the cardinality of ans-distance subset in real euclidean space, IICombinatorica, 1983
- Distance matrices, dimension, and conference graphsIndagationes Mathematicae, 1981
- Note sur le problème de UlamJournal of Combinatorial Theory, Series B, 1979
- On Two-Distance Sets in Euclidean SpaceBulletin of the London Mathematical Society, 1977