Generalized scrambling indices of a primitive digraph
โ Scribed by Yufei Huang; Bolian Liu
- Publisher
- Elsevier Science
- Year
- 2010
- Tongue
- English
- Weight
- 206 KB
- Volume
- 433
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
โฆ Synopsis
From the background of a memoryless communication system, we introduce the definition of the generalized scrambling indices for a primitive digraph, which are natural extensions of the scrambling index and m-competition index. Moreover, we provide some exact lower and upper bounds for the generalized scrambling indices of various classes of primitive digraphs, respectively.
๐ SIMILAR VOLUMES
A strongly connected digraph D of order n is primitive (aperiodic) provided the greatest common divisor of its directed cycle lengths equals 1. For such a digraph there is a minimum integer t, called the exponent of D, such that given any ordered pair of vertices x and y there is a directed walk fro