A digraph G = (V, E) is primitive i[~ for some positive integer k, there is a u ~ ~; walk of length k for evew pair u, v of vertices of V. The minimum such k is called the exponent of G, denoted exp(G). The local exponent of G at a vertex u ~ V, denoted expc(u), is the least integer k such that ther
โฆ LIBER โฆ
Primitive digraphs with smallest large exponent
โ Scribed by G. MacGillivray; S. Nasserasr; D.D. Olesky; P. van den Driessche
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 170 KB
- Volume
- 428
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Local exponents of primitive digraphs
โ
Jian Shen; Stewart Neufeld
๐
Article
๐
1998
๐
Elsevier Science
๐
English
โ 492 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
The local exponent sets of primitive dig
โ
Zhengke Miao; Kemin Zhang
๐
Article
๐
2000
๐
Elsevier Science
๐
English
โ 178 KB
On the exponent of a primitive digraph
โ
Jia-Yu Shao
๐
Article
๐
1985
๐
Elsevier Science
๐
English
โ 434 KB
Generalized exponents of primitive two-c
โ
Yubin Gao; Yanling Shao
๐
Article
๐
2009
๐
Elsevier Science
๐
English
โ 172 KB
A problem on the exponent of primitive d
โ
Jian Shen
๐
Article
๐
1996
๐
Elsevier Science
๐
English
โ 300 KB