AbstractSome graphs admit drawings in the Euclidean plane (k-space) in such a (natural) way, that edges are represented as line segments of unit length. We say that they have the unit distance property.The influence of graph operations on the unit distance property is discussed. It is proved that the Cartesian product preserves the unit distance property in the Euclidean plane, while graph union, join, tensor product, strong product, lexicographic product and corona do not. It is proved that the Cartesian product preserves the unit distance property also in higher dimensions
AbstractThe direct product (also called Kronecker product, tensor product, and cardinal product) G ×...
A subdivision of graph G, S(G), is the result of subdividing some edges of G. The subdivision number...
A distance graph G(X;D) is a graph whose set of vertices is the set of points X of a metric space (X...
AbstractSome graphs admit drawings in the Euclidean plane (k-space) in such a (natural) way, that ed...
The doctoral thesis describes problems concerning graphs that can be represented in the Euclidean pl...
AbstractA graph G=(V,E) is called a unit-distance graph in the plane if there is an embedding of V i...
In graph theory, different types of product of two graphs have been studied, e.g. Cartesian product,...
This thesis begins with a selective overview of problems in geometric graph theory, a rapidly evolvi...
Let G be a unit-distance graph in R2. For each unit-distance representation of G in R2, there is a s...
AbstractIt is proved that a number d>0 can appear as the Euclidean distance between two vertices in ...
The dimension of a graph G is the smallest d for which its vertices can be embedded in d-dimensional...
AbstractThe subdivision number of a graph G is defined to be the minimum number of extra vertices in...
A faithful (unit) distance graph in Rd is a graph whose set of vertices is a finite sub-set of the d...
AbstractA unit-distance graph in Rn is a graph with a subset of Rn as the vertex set and two vertice...
This thesis is an exposition on the paper Unit Graphs in the Plane by Dr. Severino Gervacio of the...
AbstractThe direct product (also called Kronecker product, tensor product, and cardinal product) G ×...
A subdivision of graph G, S(G), is the result of subdividing some edges of G. The subdivision number...
A distance graph G(X;D) is a graph whose set of vertices is the set of points X of a metric space (X...
AbstractSome graphs admit drawings in the Euclidean plane (k-space) in such a (natural) way, that ed...
The doctoral thesis describes problems concerning graphs that can be represented in the Euclidean pl...
AbstractA graph G=(V,E) is called a unit-distance graph in the plane if there is an embedding of V i...
In graph theory, different types of product of two graphs have been studied, e.g. Cartesian product,...
This thesis begins with a selective overview of problems in geometric graph theory, a rapidly evolvi...
Let G be a unit-distance graph in R2. For each unit-distance representation of G in R2, there is a s...
AbstractIt is proved that a number d>0 can appear as the Euclidean distance between two vertices in ...
The dimension of a graph G is the smallest d for which its vertices can be embedded in d-dimensional...
AbstractThe subdivision number of a graph G is defined to be the minimum number of extra vertices in...
A faithful (unit) distance graph in Rd is a graph whose set of vertices is a finite sub-set of the d...
AbstractA unit-distance graph in Rn is a graph with a subset of Rn as the vertex set and two vertice...
This thesis is an exposition on the paper Unit Graphs in the Plane by Dr. Severino Gervacio of the...
AbstractThe direct product (also called Kronecker product, tensor product, and cardinal product) G ×...
A subdivision of graph G, S(G), is the result of subdividing some edges of G. The subdivision number...
A distance graph G(X;D) is a graph whose set of vertices is the set of points X of a metric space (X...