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

On the -domination numbers of iterated line digraphs

โœ Scribed by Toru Hasunuma; Mayu Otani

Book ID
113564824
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
209 KB
Volume
160
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the domination numbers of generalized
On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs
โœ Yosuke Kikuchi; Yukio Shibata ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 94 KB

This work deals with the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs. Dominating sets for digraphs are not familiar compared with dominating sets for undirected graphs. Whereas dominating sets for digraphs have more applications than those for undirected graph

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

Super link-connectivity of iterated line
Super link-connectivity of iterated line digraphs
โœ Xiaoyan Cheng; Xiufeng Du; Manki Min; Hung Q. Ngo; Lu Ruan; Jianhua Sun; Weili W ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 207 KB

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 pape