A two-colored digraph D(2) is a digraph each of whose arcs is colored by red or blue. An (h,k)-walk is a walk of length h + k consisting of h red arcs and k blue arcs. A two-colored digraph is primitive provided there exist nonnegative integers h and k such that for each pair of vertices u and v there is an (h,k)-walk from u to v. The local exponent of a vertex v in D(2), denoted by exp(D(2),v), is the smallest positive integer h + k over all pairs of nonnegative integers h and k such that for every vertex u in D(2) there is an (h,k)-walk from u to v. For integer s ≥ 5, we present local exponents of two-colored digraphs D(2) consisting of two cycles whose lengths 2s + 1 and s, respectively, and has one vertex in common. For any vertex v in the two-colored digraph D(2) we present the exp(D(2),v) in terms of s, the distances from the terminal vertices of the blue arcs to the vertex of indegree 2, and the distance from the vertex of indegree 2 to the vertex v.

1.
R. A.
Brualdi
and
H. J.
Ryser
,
Combinatorial Matrix Theory
(
Cambridge University Press
,
Cambridge
,
1991
).
2.
R. A.
Brualdi
and
J. A.
Ross
,
Math. Oper. Res.
5
(
2
),
229
241
(
1980
).
3.
B. L.
Shader
and
S.
Suwilo
,
Linear Algebra Appl.
363
,
275
293
(
2003
).
4.
S.G.
Lee
and
J. M.
Yang
,
Commun. Korean.Math. Soc.
20
(
1
),
51
62
(
2005
).
5.
M.
Luo
,
Advanced Material Research
774-776
,
1823
1826
(
2013
).
6.
Y.
Gao
and
Y.
Shao
,
Linear Algebra Appl.
430
,
1550
1565
(
2009
).
7.
S.
Suwilo
,
AIP Conf. Proc.
1337
,
235
244
(
2011
).
8.
E.
Fornasini
and
M. E.
Valcher
,
SIAM J. Matrix Anal. Appl.
19
,
71
88
(
1998
).
9.
Mulyono
,
H.
Sumardi
and
S.
Suwilo
,
Far East J. Math. Sci.
96
(
1
),
113
132
(
2015
).
This content is only available via PDF.
You do not currently have access to this content.