Let Un be the infinite graph with n-dimensional rational space Q" as vertex set and two vertices joined by an edge if and only if the distance between them is exactly 1. The connectedness and clique numbers of the graphs U' are discwed. z \* . In this section we shall first prove that U1, U2, U3, a
Unit-distance graphs in Minkowski metric spaces
โ Scribed by Kiran B. Chilakamarri
- Publisher
- Springer
- Year
- 1991
- Tongue
- English
- Weight
- 453 KB
- Volume
- 37
- Category
- Article
- ISSN
- 0046-5755
No coin nor oath required. For personal study only.
โฆ Synopsis
The Unit-Distance Graph problem in Euclidean plane asks for the minimum number of colors, so that each point on the Euclidean plane can be assigned a single color with the condition that the points at unit distance apart are assigned different colors. It is well known that this number is between 4 and 7, but the exact value is not known. Here this problem is generalized to Minkowski metric spaces and once again the answer is shown to be between 4 and 7. In extreme special cases where the unit circle is a parallelogram or a hexagon the answer is shown to be exactly 4.
๐ SIMILAR VOLUMES
In this paper, we first introduce the concept of -distance on a metric space, which is a generalized concept of both w-distance and Tataru's distance. We also improve the generalizations of the Banach contraction principle, Caristi's fixed point theorem, Ekeland's variational principle, and the nonc
In this paper, we define a distance called c-distance on a cone metric space and prove a new common fixed point theorem by using the distance.