Add to ORKGAbstract. We study the dimension of graphs of the Archimedean solids. For most of these graphs we find the exact value of their dimension by finding unit-distance embeddings in the euclidean plane or by proving that such an embedding is not possible
This thesis is an exposition on the paper Unit Graphs in the Plane by Dr. Severino Gervacio of the...
AbstractA vertex x in a digraph D is said to resolve a pair u, v of vertices of D if the distance fr...
Let G be a unit-distance graph in R2. For each unit-distance representation of G in R2, there is a s...
Abstract. We study the dimension of graphs of the Archimedean solids. For most of these graphs we fi...
We study the dimension of graphs of the Archimedean solids. For most of these graphs we find the exa...
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...
The scalar product dimension d(G) of a graph G is defined to be the minimum number m such that the v...
AbstractThe euclidean dimension of a graph G, e(G), is the minimum n such that the vertices of G can...
AbstractSome graphs admit drawings in the Euclidean plane (k-space) in such a (natural) way, that ed...
AbstractWe describe a polynomial time algorithm for, given an undirected graph G, finding the minimu...
AbstractLet (Z2,E4) and (Z2,E8) be graphs where the set of vertices is the set of points of the inte...
The doctoral thesis describes problems concerning graphs that can be represented in the Euclidean pl...
Given a simple connected graph G, the metric dimension dim(G) (and edge metric dimension edim(G)) is...
AbstractThe Euclidean dimension of a graph G is the smallest integer p such that the vertices of G c...
This thesis is an exposition on the paper Unit Graphs in the Plane by Dr. Severino Gervacio of the...
AbstractA vertex x in a digraph D is said to resolve a pair u, v of vertices of D if the distance fr...
Let G be a unit-distance graph in R2. For each unit-distance representation of G in R2, there is a s...
Abstract. We study the dimension of graphs of the Archimedean solids. For most of these graphs we fi...
We study the dimension of graphs of the Archimedean solids. For most of these graphs we find the exa...
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...
The scalar product dimension d(G) of a graph G is defined to be the minimum number m such that the v...
AbstractThe euclidean dimension of a graph G, e(G), is the minimum n such that the vertices of G can...
AbstractSome graphs admit drawings in the Euclidean plane (k-space) in such a (natural) way, that ed...
AbstractWe describe a polynomial time algorithm for, given an undirected graph G, finding the minimu...
AbstractLet (Z2,E4) and (Z2,E8) be graphs where the set of vertices is the set of points of the inte...
The doctoral thesis describes problems concerning graphs that can be represented in the Euclidean pl...
Given a simple connected graph G, the metric dimension dim(G) (and edge metric dimension edim(G)) is...
AbstractThe Euclidean dimension of a graph G is the smallest integer p such that the vertices of G c...
This thesis is an exposition on the paper Unit Graphs in the Plane by Dr. Severino Gervacio of the...
AbstractA vertex x in a digraph D is said to resolve a pair u, v of vertices of D if the distance fr...
Let G be a unit-distance graph in R2. For each unit-distance representation of G in R2, there is a s...