Hamiltonian in 5-Connected Graph


k-connected graph
vertex cutset
edge cutset

How to Cite

Prastiwi, L. ., Narendra, R. ., Akbarita, R. ., & Qomarudin, M. N. H. . (2022). Hamiltonian in 5-Connected Graph. Proceedings of the International Seminar on Business, Education and Science, 1(1), 107–115. https://doi.org/10.29407/int.v1i1.2678


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.
Keywords: k-connected graph, Hamiltonian, vertex cuts

Creative Commons License

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Copyright (c) 2022 Leni Prastiwi, Risang Narendra, Rachmadania Akbarita, M. Nur Haqqul Qomarudin


Download data is not yet available.