Bounds on the absorbant number of generalized Kautz digraphs
โ Scribed by Ling-ye Wu; Er-fang Shan
- Book ID
- 107482763
- Publisher
- Chinese Electronic Periodical Services
- Year
- 2010
- Tongue
- English
- Weight
- 105 KB
- Volume
- 14
- Category
- Article
- ISSN
- 1007-6417
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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
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.