PERSAMAAN UMUM JUMLAH EDGE DAN TITIK PADA CYCLE EXTENSION CUBIC GRAPH

Abstract

In this research we will discuss about cycle extension  of  cubic graph. The cubic graphs used are the cucic graph with n(V(G)) ≤ 8 and k ≥ 3, ;  k is the length of the cycle C and l_i is the number of vertices or points on  that located between  and  .  The construction process for determining the  use six operations which are M₁, M₂, M₃, M₄, M₅, dan M₆. The result of M₁ process on     is a non Hamiltonian cycle while the results of M₂, M₃, M₄, M₅, and M₆ are Hamiltonian cycles. We also show that the  number of vertives on the   is  n(V()) = n (V(G)) + 2 k  ,

and  the number of edges on the   is  n(E() = n (E(G)) + 3 k.