𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Super link-connectivity of iterated line digraphs

✍ Scribed by Xiaoyan Cheng; Xiufeng Du; Manki Min; Hung Q. Ngo; Lu Ruan; Jianhua Sun; Weili Wu

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
207 KB
Volume
304
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

✦ Synopsis

Many interconnection networks can be constructed with line digraph iterations. A digraph has super link-connectivity d if it has link-connectivity d and every link-cut of cardinality d consists of either all out-links coming from a node, or all in-links ending at a node, excluding loop. In this paper, we show that the link-digraph iteration preserves super link-connectivity.

πŸ“œ SIMILAR VOLUMES

Super Connectivity of Line Graphs and Di
Super Connectivity of Line Graphs and Digraphs
✍ Min LΓΌ; Jun-Ming Xu πŸ“‚ Article πŸ“… 2006 πŸ› Institute of Applied Mathematics, Chinese Academy 🌐 English βš– 121 KB
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

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