✦ LIBER ✦

The exponent and circumdiameter of primitive digraphs

✍ Scribed by L.F. Dame; D.D. Olesky; P. van den Driessche

Book ID: 108198771
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 291 KB
Volume: 396
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2004.09.004

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

The second exponent set of primitive dig

The second exponent set of primitive digraphs

✍ Zhengke, Miao; Kemin, Zhang 📂 Article 📅 2000 🏛 Coastal and Estuarine Research Federation 🌐 English ⚖ 101 KB

The local exponent sets of primitive dig

The local exponent sets of primitive digraphs

✍ 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 symme

Generalized exponents of primitive symmetric digraphs

✍ 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 problem on the exponent of primitive d

A problem on the exponent of primitive digraphs

✍ Jian Shen 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 300 KB