Minimal Euclidean representations of graphs
From MaRDI portal
Publication:965947
DOI10.1016/j.disc.2009.09.005zbMath1213.05183arXiv0812.3707OpenAlexW2118876122MaRDI QIDQ965947
Publication date: 27 April 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0812.3707
algebraic graph theorygraph spectrummain eigenvaluegraph eigenvaluemain angleEuclidean representationEuclidean 2-distance setrepresentable graph
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (9)
Gershgorin Disks for Multiple Eigenvalues of Non-negative Matrices ⋮ The two-distance sets in dimension four ⋮ Binary representations of regular graphs ⋮ Complex spherical codes with two inner products ⋮ Complex spherical codes with three inner products ⋮ A geometrical characterization of strongly regular graphs ⋮ On representations of graphs as two-distance sets ⋮ Graphs and spherical two-distance sets ⋮ On a problem of Specker about Euclidean representations of finite graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An upper bound for the cardinality of an s-distance subset in real Euclidean space. II
- Properties of Euclidean and non-Euclidean distance matrices
- Note sur le problème de Ulam
- Solving Euclidean distance matrix completion problems via semidefinite progrmming
- New maximal two-distance sets
- Chromatic number and the 2-rank of a graph
- The cone of distance matrices
- Matrix Analysis
- On Two-Distance Sets in Euclidean Space
- Developments in the theory of graph spectra
- Spectra of random graphs with given expected degrees
- Metric Spaces and Positive Definite Functions
This page was built for publication: Minimal Euclidean representations of graphs