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

On hardware for generating routes in Kautz digraphs

โœ Scribed by Gerard J.M. Smit; Paul J.M. Havinga; Pierre G. Jansen; Fokke de Boer; Bert Molenkamp

Book ID
104179079
Publisher
Elsevier Science
Year
1991
Weight
654 KB
Volume
32
Category
Article
ISSN
0165-6074

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Twin domination in generalized Kautz dig
Twin domination in generalized Kautz digraphs
โœ Yan-xia Dong; Er-fang Shan; Ling-ye Wu ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Chinese Electronic Periodical Services ๐ŸŒ English โš– 187 KB
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 a generalization of transitivity for
On a generalization of transitivity for digraphs
โœ Andras Gyรกrfรกs; Michael S. Jacobson; Lael F. Kinch ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 758 KB

In this paper we investigate the foliowing generalization of transitivity: A digraph D is (m, n)-transitive whenever there is a path of length m from x to y there is a subset of n + 1 vertices of these m + 1 vertices which contain a path of length n from x to y. Here we study various properties of