𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Comments on "Line digraph iterations and connectivity analysis of de Bruijn and Kautz graphs"

✍ Scribed by Padro, C.; Morillo, P.; Fiol, M.A.

Book ID
119772479
Publisher
IEEE
Year
1996
Tongue
English
Weight
138 KB
Volume
45
Category
Article
ISSN
0018-9340

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

On even factorizations and the chromatic
On even factorizations and the chromatic index of the Kautz and de Bruijn digraphs
✍ Jean-Claude Bermond Cnrs; Pavol Hell πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 484 KB

## Abstract Motivated by the problem of designing large packet radio networks, we show that the Kautz and de Bruijn digraphs with in‐ and outdegree __d__ have arc‐chromatic index __2d__. In order to do this, we introduce the concept of even 1‐factorizations. An even 1‐factor of a digraph is a spann