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

On the number of cycles in generalized Kautz digraphs

โœ Scribed by Toru Hasunuma; Yosuke Kikuchi; Takeshi Mori; Yukio Shibata

Book ID
108113421
Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
281 KB
Volume
285
Category
Article
ISSN
0012-365X

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 the diameter vulnerability of Kautz d
On the diameter vulnerability of Kautz digraphs
โœ D.Z. Du; D.F. Hsu; Y.D. Lyuu ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 223 KB

We show that in the Kautz digraph K(d, t) with d' + d'-1 vertices each having out degree d, there exist d vertex-disjoint paths between any pair of distinct vertices, one of length at most t, d -2 of length at most t + 1, and one of length at most t + 2.