𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some properties of contractible transformations on graphs

✍ Scribed by Alexander V. Ivashchenko

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
458 KB
Volume
133
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

DISCRETE MATHEMATICS

Many applications of digital image processing now deal with three and more dimensional images. One way of tracing the digital images of n-dimensional continuous spaces is to use molecular spaces and its intersection graphs. Two graphs modeling the same space can be transformed into each other by contractible transformations.

It was shown that contractible transformations retained the Euler characteristic and the homology groups on graphs.

In this paper we continue studying properties of these transformations on graphs.

Elsevier Science B.V.

πŸ“œ SIMILAR VOLUMES

Contractible transformations do not chan
Contractible transformations do not change the homology groups of graphs
✍ Alexander V. Ivashchenko πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 626 KB

In this paper we continue to study properties of contractible transformations of graphs. We prove that contractible transformations do not change the homology groups of graphs.

Some applications of graph contractions
Some applications of graph contractions
✍ LΓ‘szlΓ³ Babai πŸ“‚ Article πŸ“… 1977 πŸ› John Wiley and Sons 🌐 English βš– 248 KB

## Abstract Results in diverse areas, such as the Nielsen‐Schreier theorem on subgroups of free groups and a proof of A. T. White's conjecture on the genus of subgroups are shown to be immediate consequences of a lemma which has already proved useful in investigating topological properties and auto

On some properties of 4-regular plane gr
On some properties of 4-regular plane graphs
✍ Mirko HorňÑ; Stanislav JendroΔΎ πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 542 KB

## Abstract The __d__‐distance face chromatic number of a connected plane graph is the minimum number of colors in such a coloring of its faces that whenever two distinct faces are at the distance at most __d__, they receive distinct colors. We estimate 1‐distance chromatic number for connected 4‐r

Some properties of 2-threshold graphs
Some properties of 2-threshold graphs
✍ P. L. Hammer; N. V. R. Mahadev; U. N. Peled πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 330 KB