On representations of graphs as two-distance sets
From MaRDI portal
Publication:2279265
Abstract: Let a
eq b be two positive scalars. A Euclidean representation of a simple graph G in R^r is a mapping of the nodes of G into points in R^r such that the squared Euclidean distance between any two points is a if the corresponding nodes are adjacent and b otherwise. A Euclidean representation is spherical if the points lie on an (r-1)-sphere, and is J-spherical if this sphere has radius 1 and a=2 < b. Let dim_E(G), dim_S(G) and dim_J(G) denote, respectively, the smallest dimension r for which G admits a Euclidean, spherical and J-spherical representation. In this paper, we extend and simplify the results of Roy[18] and Nozaki and shinohara[17] by deriving exact simple formulas for dim_E(G) and dim_S(G) in terms of the eigenvalues of V^TAV, where A is the adjacency matrix of G and V is the matrix whose columns form an orthonormal basis for the orthogonal complement of the vector of all 1's. We also extend and simplify the results of Musin [16] by deriving explicit formulas for determining the J-spherical representation of G and for determining dim_J(G)in terms of the largest eigenvalue of �ar{A}, the adjacency matrix of the complement graph �ar{G}. As a byproduct, we obtain several related results and in particular we answer a question raised by Musin in [16].
Recommendations
- Graph representations, two-distance sets, and equiangular lines
- scientific article; zbMATH DE number 1409224
- Distance-two labelings of graphs
- Publication:3199436
- Graphs and spherical two-distance sets
- On representations of some thickness-two graphs
- Distance two labeling of the composition of graphs
- Characterizing 2-distance graphs
- On set intersection representations of graphs
- On the dimension to represent a graph by a unit distance graph
Cites work
- scientific article; zbMATH DE number 3121295 (Why is no real title available?)
- scientific article; zbMATH DE number 3895787 (Why is no real title available?)
- scientific article; zbMATH DE number 3774424 (Why is no real title available?)
- scientific article; zbMATH DE number 3234139 (Why is no real title available?)
- scientific article; zbMATH DE number 3261280 (Why is no real title available?)
- A geometrical characterization of strongly regular graphs
- An upper bound for the cardinality of an s-distance subset in real Euclidean space. II
- Circum-Euclidean distance matrices and faces
- Distance matrices and regular figures
- Euclidean distance matrices and their applications in rigidity theory
- Graphs and spherical two-distance sets
- Minimal Euclidean representations of graphs
- New maximal two-distance sets
- On certain linear mappings between inner-product and squared-distance matrices
- On rigidity and realizability of weighted graphs
- Properties of Euclidean and non-Euclidean distance matrices
- Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert
- Spherical codes and designs
- Two theorems on Euclidean distance matrices and Gale transform
Cited in
(6)
This page was built for publication: On representations of graphs as two-distance sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2279265)