On representations of graphs as two-distance sets
From MaRDI portal
Publication:2279265
DOI10.1016/j.disc.2019.07.003zbMath1429.05146arXiv1808.05915OpenAlexW2964123572MaRDI QIDQ2279265
Publication date: 12 December 2019
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.05915
Euclidean distance matricesEuclideanspherical and \(J\)-spherical representationsspherical EDMstwo-distance sets
Distance in graphs (05C12) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimal Euclidean representations of graphs
- An upper bound for the cardinality of an s-distance subset in real Euclidean space. II
- Properties of Euclidean and non-Euclidean distance matrices
- On certain linear mappings between inner-product and squared-distance matrices
- Spherical codes and designs
- Distance matrices and regular figures
- New maximal two-distance sets
- A geometrical characterization of strongly regular graphs
- Circum-Euclidean distance matrices and faces
- Graphs and spherical two-distance sets
- Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert
- Euclidean Distance Matrices and Their Applications in Rigidity Theory
- On rigidity and realizability of weighted graphs
- Two theorems on Euclidean distance matrices and Gale transform