✦ LIBER ✦

The divider dimension of the graph of a function

✍ Scribed by Steven R Dunbar; Rod W Douglass; W.J Camp

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 483 KB
Volume: 167
Category: Article
ISSN: 0022-247X
DOI: 10.1016/0022-247x(92)90215-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The rotational dimension of a graph

✍ Frank Göring; Christoph Helmberg; Markus Wappler 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 195 KB

The circular dimension of a graph

✍ Robert B. Feinberg 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 484 KB

A graph is a pair (V, I), V being the vertices and I being the relation of adjacency on V. Given a grqh G, then a collection of functions (fi}~ ,, each fi mapping each vertex of V into an arc on a fixed circle, is said to define an m-arc intersection model for G if for all x, y E V, xly e=, (Vi~ml(f

The frame dimension and the complete ove

The frame dimension and the complete overlap dimension of a graph

✍ Jeffrey E. Steif 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 715 KB

Roberts (F. S. Roberts, On the boxicity and cubicity of a graph. In Recent Progress in Cornbinarorics, W. T. Tutte, ed. Academic, New York (1 969)), studied the intersection graphs of closed boxes (products of closed intervals) in Euclidean n-space, and introduced the concept of the boxicity of a gr

The vapnik-chervonenkis dimension of a r

The vapnik-chervonenkis dimension of a random graph

✍ Martin Anthony; Graham Brightwell; Colin Cooper 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 652 KB

In this paper we investigate a parameter defined for any graph, known as the Vapnik Chervonenkis dimension (VC dimension). For any vertex x of a graph G, the closed neighborhood N(x) of x is the set of all vertices of G adjacent to x, together with x. We say that a set D of vertices of G is shattere

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

The dimension of sums of graphs

✍ Peter Alles 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 235 KB

For a graph G, dim G is defined to be the least natural number n such that G is an induced subgraph of a categorial (or direct) product of n complete graphs. The dimension of sums of graphs has been studied in [3] and [8]. The aim if this article is to improve the upper estimates achieved by Poljak