2-Eksponen Digraph Dwiwarna Asimetrik Dengan Dua Cycle Yang Bersinggungan

Main Author: Syahputra, Indra
Other Authors: Mardiningsih, Suwilo, Saib
Format: Student Papers
Bahasa: ind
Subjects:
Online Access: http://repository.usu.ac.id/handle/123456789/14110
Daftar Isi:
  • Let D be a asymmetric two-colored digraph on n = 2m, m _ 4 vertices which have a common vertex and the length of each cycles is m and m + 1. Since D is asymmetric, there exists two cycles of length m are denoted by 1 and 2 and two cycles of length m + 1 are denoted by 3 and 4 and also has cycles of length 2. If 1 dan 3 have each exactly one blue arc, This research will show that usedly a 2 by 2 submatrix with determinant 1 of cycle matrix in D then obtained exp2 (D) _1 2(2n2 ? n ? 6). On emprical data show that the 2-exponents of D can be achieved using (h, k)-walks with h = k. Using this fact we show that exp2(D) _ 1 2 (n2+2n).
  • 09E01157