๐”– Bobbio Scriptorium
โœฆ   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

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

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