𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Classes of graphs which approximate the complete euclidean graph

✍ Scribed by J. Mark Keil; Carl A. Gutwin

Publisher
Springer
Year
1992
Tongue
English
Weight
866 KB
Volume
7
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the euclidean dimension of a complete
On the euclidean dimension of a complete multipartite graph
✍ Hiroshi Maehara πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 272 KB

The euclidean dimension of a graph G, e(G), is the minimum n such that the vertices of G can be placed in euclidean n-space, R", in such a way that adjacent vertices have distance 1 and nonadjacent vertices have distances other than 1. Let G = K(n,, . , ns+,+J be a complete (s + t + u)-partite graph

Graphs of Finite Mass Which Cannot Be Ap
Graphs of Finite Mass Which Cannot Be Approximated by Smooth Graphs with Equibounded Area
✍ Domenico Mucci πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 369 KB

We show that there exist graphs of Cartesian maps, of finite mass, which cannot be approximated weakly as currents by graphs of smooth maps with equibounded area. ## 1998 Academic Press This paper deals with the relaxed extension of the nonparametric area functional for vector valued maps. Let 0