✦ LIBER ✦

The Decomposition Dimension of Graphs

✍ Scribed by Gary Chartrand; David Erwin; Michael Raines; Ping Zhang

Publisher: Springer Japan
Year: 2001
Tongue: English
Weight: 100 KB
Volume: 17
Category: Article
ISSN: 0911-0119
DOI: 10.1007/pl00007252

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Probabilistic Methods for Decomposition

Probabilistic Methods for Decomposition Dimension of Graphs

✍ Mariko Hagita; André Kündgen; Douglas B. West 📂 Article 📅 2003 🏛 Springer Japan 🌐 English ⚖ 305 KB

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

Split dimension of graphs

✍ Arkady A. Chernyak; Zhanna A. Chernyak 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 380 KB

## Chernyak, A.A. and Z.A. Chernyak, Split dimension of graphs, Discrete Mathematics 89 (1991) l-6.

Decomposition of graphs

✍ R. I. Tyshkevich; A. A. Chernyak 📂 Article 📅 1985 🏛 Springer US 🌐 English ⚖ 794 KB

Curvature dimension of trivalent graphs

✍ Kazushiro Kobayashi 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 422 KB

In this paper we show that the curvature dimension, recently defined by Taniyama [5], of connected trivalent graphs in Euclidean space equals two in the case of bridgeless graphs and one for graphs having one or two bridges. We also show that there exists a connected trivalent graph in Euclidean spa

Resolvability and the upper dimension of

Resolvability and the upper dimension of graphs

✍ G. Chartrand; C. Poisson; P. Zhang 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 832 KB

For an ordered set W = (~1, ~2,. , wk} of vertices and a vertex 2) in a connected graph G, the (metric) representation of v with respect to W is the /c-vector T(V 1 W) = (d(v,wl), d(v, wz), , d(v, wk)), where d(z, y) represents the distance between the vertices z and y. The set IV is a resolving set