Key points are not available for this paper at this time.
A simple graph G with p vertices is said to be vertex-Euclidean if there exists a bijection f: V (G) → 1, 2, …, p such that f (v 1) + f (v 2) > f (v 3) for each C 3 -subgraph with vertex set v 1, v 2, v 3, where f (v 1) < f (v 2) < f (v 3). More generally, the vertex-Euclidean deficiency of a graph G is the smallest integer k such that G ∪ N k is vertex-Euclidean. To illustrate the idea behind this new graph labeling problem, we study the vertex-Euclidean deficiency of two new families of graphs called the complete fan graphs and the complete wheel graphs. We also explore some related problems, and pose several research topics for further study.
Gao et al. (Sun,) studied this question.