CD Skripsi
Sifat Hamiltonian Dan Hipohamiltonian Pada Graf Petersen Diperumum (Gpn,6)
This final project discusses the validity of Hamiltonian and Hypohamiltonian properties of the Petersen graph and the generalized Petersen graph (GPn,6) by constructing steps to find the existence of the Hamilton cycle. A graph that has a Hamilton cycle is called a Hamiltonian graph. Furthermore, a graph that is not Hamiltonian and if one of the vertices is removed then it will form a Hamilton cycle is called a Hypohamiltonian graph. The Petersen graph is a cubic graph with ten vertices and fifteen edges and each vertex has the degree of three. The generalized Petersen graph is an extension of the Petersen graph which is denoted by (GPn,k) for positive numbers n and k with 2 2k < n. Based on the construction, it is found that Hamiltonian and Hypohamiltonian properties apply to Petersen graph and generalized Petersen graph (GPn,6). In the Petersen graph has Hypohamiltonian properties. In the generalized Petersen graph for n = 14, 16, 20, 22 the Hamiltonian property applies, for n = 13 the Hypohamiltonian property applies, and for n = 15, 17, 18, 19, 21, 23, 24 neither of these properties apply.
Keywords: Petersen graph, Generalized Petersen graph, Hamiltonian, Hipo- hamiltonian
Tidak tersedia versi lain