Let D = (V, E) be a primitive digraph. The exponent of D, denoted byγ(D), is the least integer k such that for any u, v∈ V there is a directed walk of length k from u to v. The local exponent of D at a vertex u∈ V,...Let D = (V, E) be a primitive digraph. The exponent of D, denoted byγ(D), is the least integer k such that for any u, v∈ V there is a directed walk of length k from u to v. The local exponent of D at a vertex u∈ V, denoted by exp_D (u), is the least integer k such that there is a directed walk of length k from u to v for each v ε V. Let V = {1,2,….,n}. Following [1], the vertices of V are ordered so that exp_D (1) ≤exp_D (2) ≤…≤exp_D(n) =λ(D). Let E_n(i):= {exp_D (i) ∈D PD_n}, where PD_n is the set of all primitive digraphs of order n. It is known that E_n(n) = {γ(D) D∈PD_n} has been completely settled by [7]. In 1998, E_n(1) was characterized by [5]. In this paper, the authors describe E_n(2) for all n≥2.展开更多
基金National Natural Science Foundation of China Jiangsu Provincial Natural Science Foundation of China.
文摘Let D = (V, E) be a primitive digraph. The exponent of D, denoted byγ(D), is the least integer k such that for any u, v∈ V there is a directed walk of length k from u to v. The local exponent of D at a vertex u∈ V, denoted by exp_D (u), is the least integer k such that there is a directed walk of length k from u to v for each v ε V. Let V = {1,2,….,n}. Following [1], the vertices of V are ordered so that exp_D (1) ≤exp_D (2) ≤…≤exp_D(n) =λ(D). Let E_n(i):= {exp_D (i) ∈D PD_n}, where PD_n is the set of all primitive digraphs of order n. It is known that E_n(n) = {γ(D) D∈PD_n} has been completely settled by [7]. In 1998, E_n(1) was characterized by [5]. In this paper, the authors describe E_n(2) for all n≥2.
