๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Minimal graphs of a torus, a projective plane and spheres and some properties of minimal graphs of homotopy classes

โœ Scribed by Alexander V. Ivashchenko; Yeong-Nan Yeh

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

No coin nor oath required. For personal study only.

โœฆ Synopsis

Contractible

transformations of graphs consist of contractible gluing and deleting of vertices and edges of graphs. They partition all graphs into the family of homotopy classes. Contractible transformations do not change the Euler characteristic and the homology groups of graphs. In this paper we describe the minimal representatives of some homotopy classes and find the formula for computing the Euler characteristic of partite and some other graphs. We also describe the minimal graphs of a projective plane, a torus and a sphere.

๐Ÿ“œ SIMILAR VOLUMES

On some minimal graphs of the torus
On some minimal graphs of the torus
โœ R. Bodendiek; K. Wagner ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 259 KB ๐Ÿ‘ 1 views

## Let be the set of finite, simple and nondirected graphs being not embeddable into the torus. Furthermore let >4 be a partial order-relation and M, (r) the minimal basis of I'. In this paper we determine three graphs of M, (r) being embeddable into the projective plane and containing the subgrap

Some classes of perfectly orderable grap
Some classes of perfectly orderable graphs
โœ C. T. Hoร ng; B. A. Reed ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 815 KB

In 1981, Chvatal defined the class of perfectly orderable graphs. This class of perfect graphs contains the comparability graphs and the triangulated graphs. In this paper, we introduce four classes of perfectly orderable graphs, including natural generalizations of the comparability and triangulate

Cyclic gossiping times for some classes
Cyclic gossiping times for some classes of graphs
โœ Knisely, James A.; Laskar, Renu ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 574 KB

Gossiping and broadcasting are two problems of information dissemination described for a group of individuals connected by a communication network. In gossiping, every person in the network knows a unique item of information and needs to communicate it to everyone else. In broadcasting, one individu