Scrambling Index dari Digraf Hamilton Dwiwarna Atas n ≡ 1 (mod 3) Titik

Abstract

ABSTRACT A two-colored digraph D(2) is a digraph whose arcs colored red or blue. Scram bling index of D(2) is smallest positive integer h + ` over all pairs of nonnegative integers h red arcs and ` blue arcs such that for each pair of vertices vi and vj in D(2) there is a vertex vw in D(2) with the property that there exist a (h, `)- walk from vi to vw and from vj to vw. This paper discusses about formula for scrambling index of primitive two-colored Hamiltonian digraphs consists two cy cles with length of cycle one is n − 3 and length of cycle two is n, on n ≡ 1 (mod 3) vertices, n ≥ 7 with (n − 4)/3 consecutive blue arcs on both cycles. Keywords: Two-Colored Digraphs, Primitive, Scrambling Index.