2 Eksponen dari 2-Digraph dengan Loop

Abstract

On 2-digraph D, 2-exponent being defined as smallest integer h+k therefore for every pairs of vertex u and v in D there is walk from u to v with legth h + k consist of h red arc and b blue arc. 2-exponent from 2-digraph D denoted by exp2(D) Shader and suwilo show that 2-exponent from primitive 2-digraph lying on ((n3 − 5n2)/2, (3n3+2n2−2n)) interval. This paper will give the general form of 2-digraphwith 2-exponent exactly 2n,2n-1,2n-2