𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the dimension to represent a graph by a unit distance graph

✍ Scribed by Hiroshi Maehara; Vojtech Rödl

Book ID
105309172
Publisher
Springer Japan
Year
1990
Tongue
English
Weight
133 KB
Volume
6
Category
Article
ISSN
0911-0119

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

On the degree distance of a graph
On the degree distance of a graph
✍ P. Dankelmann; I. Gutman; S. Mukwembi; H.C. Swart 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 373 KB
On the distance matrix of a directed gra
On the distance matrix of a directed graph
✍ R. L. Graham; A. J. Hoffman; H. Hosoya 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 2 views

## Abstract In this note, we show how the determinant of the distance matrix __D(G__) of a weighted, directed graph __G__ can be explicitly expressed in terms of the corresponding determinants for the (strong) blocks __G~i~__ of __G__. In particular, when cof __D(G__), the sum of the cofactors of _