A nonnegative matrix A is said to be primitive if there exists a positive integer m such that
entries in A^ m are positive and smallest such m is called the exponent of A: Primitive …

A bicolour digraph D< sup>(2) is a directed graph with every arc coloured in one of two
colours, red or black. Suppose r and k are nonnegative integers representing the number of …

A digraph that has arcs of two colours is called a two-coloured digraph. In this case, the
colours used are red and black. Let d and k be non-negative integers, where d represents …

A two-coloured digraph D< sup>(2) is a digraph in which each arc is coloured with one of
two colours--for example, red or black. A two-coloured digraph D< sup>(2) is said to be …

The competition index of a primitive two-colored digraph D^ 2, denoted k (D^((2))), is the
smallest positive integer h+ l such that for each pair of vertices u and v there is vertex w with …

Let D be a digraph on n vertices {v 1, v 2,..., vn}. A two-colored digraph D (2) is a digraph D
such that each of its arcs is colored by red or blue. An (h, k)-walk is a walk with precisely h …

A bicolour digraph is a directed graph with arcs in two colours, red and black. Let m and h be
nonnegative integers representing the number of red arcs and black arcs, respectively. The …

Vertex Exponent of Asymmetric Two-coloured Cycle Page 1 Journal of Research in
Mathematics Trends and Technology (JoRMTT) Vol. 2, No. 2, 2020 | 37-44 Journal of Research …

A two-colored digraph is a digraph for which each of its arc is colored by red or blue. An (h,
ℓ)-walk is a walk consisting of h red arcs and ℓ blue arcs. A strongly connected two-colored …