CD Skripsi
Siklus Hamilton Pada Graf Bunga Wijaya Kusuma (Wkn)
This final project discusses the Hamiltonian cycle on a new graph, namely the wijaya kusuma flower graph which is constructed by representing the original wijaya kusuma flower structure into a graph form. The vertex set V represents the flower structure such as the pistil, stamen, petals, and sepals, while the edge set E represents the relationship among these components. A Hamiltonian cycle is a cycle that passes through each vertex exactly once and a Hamiltonian graph is a graph that contains a Hamiltonian cycle. To prove the existence of a Hamiltonian cycle on the wijaya kusuma flower graph, two methods are employed: direct proof, and partition proof. Based on these two methods, the results show that the Wijaya Kusuma flower graph contain a Hamiltonian cycle. Therefore, it can be concluded that the Wijaya Kusuma flower graph is a Hamiltonian graph.
Keywords: Hamiltonian cycle, wijaya kusuma flower graph, cycle graph, wheel graph
Tidak tersedia versi lain