✦ LIBER ✦

Distances in a rigid unit-distance graph in the plane

✍ Scribed by Hiroshi Maehara

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 411 KB
Volume: 31
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(91)90070-d

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Subdividing a Graph Toward a Unit-distan

Subdividing a Graph Toward a Unit-distance Graph in the Plane

✍ Severino V. Gervacio; Hiroshi Maehara 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 150 KB

The subdivision number of a graph G is defined to be the minimum number of extra vertices inserted into the edges of G to make it isomorphic to a unit-distance graph in the plane. Let t (n) denote the maximum number of edges of a C 4 -free graph on n vertices. It is proved that the subdivision numbe

Uniform distances in rational unit-dista

Uniform distances in rational unit-distance graphs

✍ Joseph Zaks 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 387 KB

Every Graph Is an Integral Distance Grap

Every Graph Is an Integral Distance Graph in the Plane

✍ Hiroshi Maehara; Katsuhiro Ota; Norihide Tokushige 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 290 KB

We prove that every finite simple graph can be drawn in the plane so that any two vertices have an integral distance if and only if they are adjacent. The proof is constructive.

Unit-distance graphs in rational n-space

Unit-distance graphs in rational n-spaces

✍ Kiran B. Chilakamarri 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 576 KB

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

Unit-distance graphs in Minkowski metric spaces

✍ Kiran B. Chilakamarri 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 453 KB

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 a

Distance-regular Subgraphs in a Distance

Distance-regular Subgraphs in a Distance-regular Graph, III

✍ Akira Hiraki 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 254 KB

Let ⌫ be a distance-regular graph with l (1 , a 1 , b 1 ) ϭ 1 and c s ϩ 1 ϭ 1 for some positive integer s . We show the existence of a certain distance-regular graph of diameter s , containing given two vertices at distance s , as a subgraph in ⌫ .