@article{Prastiwi_Narendra_Akbarita_Qomarudin_2022, title={Hamiltonian in 5-Connected Graph}, volume={1}, url={https://proceeding.unpkediri.ac.id/index.php/ip/article/view/2678}, DOI={10.29407/int.v1i1.2678}, abstractNote={<p>One of the branches of mathematics that studies the properties of graphs is graph theory. The purpose of this study is to find out how to prove the Hamiltonian on a 5-connected graph. Through the stages, including modeling a complete graph, as well as modeling a 5-connected graph using vertices and cut edges, it was found that is a graph that satisfies the characteristics of a 5-connected graph. Analysis of Hamiltonian on 5-connected graph that 5-connected graph is Hamilton’s invention, but it is not uniquely Hamiltonian because it has more than one Hamiltonian circuit.<br>Keywords: k-connected graph, Hamiltonian, vertex cuts</p>}, number={1}, journal={Proceedings of the International Seminar on Business, Education and Science}, author={Prastiwi, Leni and Narendra, Risang and Akbarita, Rachmadania and Qomarudin, M. Nur Haqqul}, year={2022}, month={Oct.}, pages={107–115} }