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

Embedding iterated line digraphs in books

โœ Scribed by Toru Hasunuma

Publisher
John Wiley and Sons
Year
2002
Tongue
English
Weight
306 KB
Volume
40
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Diameter vulnerability of iterated line
Diameter vulnerability of iterated line digraphs
โœ C. Padrรณ; P. Morillo ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 823 KB

Because of their good properties, iterated line digraphs (specially Kautz and de Bruijn digraphs) have been considered to design interconnection networks. The diameter-vulnerability of a digraph is the maximum diameter of the subdigraphs obtained by deleting a fixed number of vertices or arcs. For a

A Broadcasting Protocol in Line Digraphs
A Broadcasting Protocol in Line Digraphs
โœ Jean-Claude Bermond; Xavier Muรฑoz; Alberto Marchetti-Spaccamela ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 207 KB

We propose broadcasting algorithms for line digraphs in the telegraph model. The new protocols use a broadcasting protocol for a graph G to obtain a broadcasting protocol for the graph L k G, the graph obtained by applying k times, the line digraph operation to G. As a consequence improved bounds fo

Hamilton cycles and closed trails in ite
Hamilton cycles and closed trails in iterated line graphs
โœ Paul A. Catlin; Iqbalunnisa T. N. Janakiraman; N. Srinivasan ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 712 KB

## Abstract Let __G__ be an undirected connected graph that is not a path. We define __h__(__G__) (respectively, __s__(__G__)) to be the least integer __m__ such that the iterated line graph __L__^__m__^(__G__) has a Hamiltonian cycle (respectively, a spanning closed trail). To obtain upper bounds