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

Eulerian iterated line graphs and digraphs

โœ Scribed by Erich Prisner

Book ID
108315612
Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
97 KB
Volume
236
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Spanners of underlying graphs of iterate
Spanners of underlying graphs of iterated line digraphs
โœ Rabah Harbane; Carles Padrรณ ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 770 KB

Given a simple undirected graph G, a spanning subgraph S is a t-spanner of G if every pair of vertices that are adjacent in G are at distance at most I in S. The factor t is called the dilution of the spanner. If S has the smallest possible number of edges among all t-spanners of G, then S is a mini

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