Our purpose in this note is to present a natural geometrical definition of the dimension of a graph and to explore some of its ramifications. In $1 we determine the dimension of some special graphs. We observe in 92 that several results in the literature are unified by the concept of the dimension of a graph, and state some related unsolved problems. We define the dimension of a graph G, denoted dim G, as the minimum number n such that G can be embedded into Euclidean n-space E,, with every edge of G having length 1. The vertices of C are mapped onto distinct points of E,, but there is no restriction on the crossing of edges.
[1]
A. B. Cook.
Some unsolved problems.
,
1952,
Hospital management.
[2]
P. Erdos.
Some unsolved problems.
,
1957
.
[3]
A. Leaf.
GRAPH THEORY AND PROBABILITY
,
1957
.
[4]
P. Erdös,et al.
Graph Theory and Probability
,
1959
.
[5]
P. Erdös.
On circuits and subgraphs of chromatic graphs
,
1962
.
[6]
P. Erdos,et al.
An extremal problem in the theory of interpolation
,
1964
.
[7]
P Erd,et al.
On Sets of Distances of N Points in Euclidean Space
,
2022
.