Configuration spaces of weighted graphs in high dimensional Euclidean spaces (Q1610959)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Configuration spaces of weighted graphs in high dimensional Euclidean spaces |
scientific article |
Statements
Configuration spaces of weighted graphs in high dimensional Euclidean spaces (English)
0 references
20 August 2002
0 references
Here a weighted graph \(G\) is a finite graph with a positive weight associated to each edge of \(G\). An ordered set of points in \(\mathbb{R}^n\) representing the vertices of \(G\) is called a realisation of \(G\) if, for each edge of \(G\), the distance of the corresponding points is equal to the weight of the edge. The configuration space of \(G\) is the set of all possible realisations of \(G\) modulo the group of proper isometries of the space \(\mathbb{R}^{n}\) (with the natural topology). The main result reads as follows. Let \(G\) be a connected weighted graph with \(n+1\) vertices and \(e\) edges which admits not only degenerated realisations in \(\mathbb{R}^{n}\). Then the configuration space of \(G\) is homeomorphic to the sphere of dimension \(n(n+1)/2-e\).
0 references
distance-preserving embeddings of graphs
0 references
realisation
0 references