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 generalize
โฆ LIBER โฆ
Generalized competition index of a primitive digraph
โ Scribed by Hwa Kyung Kim
- Publisher
- Elsevier Science
- Year
- 2010
- Tongue
- English
- Weight
- 164 KB
- Volume
- 433
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Generalized scrambling indices of a prim
โ
Yufei Huang; Bolian Liu
๐
Article
๐
2010
๐
Elsevier Science
๐
English
โ 206 KB
Generalized exponents of primitive symme
โ
Richard A. Brualdi; Shao Jia-yu
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 1014 KB
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
A bound on the generalized competition i
โ
Hwa Kyung Kim
๐
Article
๐
2011
๐
Elsevier Science
๐
English
โ 212 KB
Generalized exponents of primitive two-c
โ
Yubin Gao; Yanling Shao
๐
Article
๐
2009
๐
Elsevier Science
๐
English
โ 172 KB
On the exponent of a primitive digraph
โ
Jia-Yu Shao
๐
Article
๐
1985
๐
Elsevier Science
๐
English
โ 434 KB
On the exponent of a primitive, minimall
โ
Yang Shangjun; George P. Barker
๐
Article
๐
1988
๐
Elsevier Science
๐
English
โ 960 KB