¿Qué es un grafo hamiltoniano? | 37/42 | UPV

Title: What is a Hamiltonian graph? Description: Introduction to concepts related to Hamiltonian graphs. Jordan Lluch, C. (2010). What is a Hamiltonian graph? http://hdl.handle.net/10251/7859 Automatic description: This video explains the concept of a Hamiltonian graph, graph closure, and its relationship to Eulerian graphs. It defines a Hamiltonian graph as one that contains a cycle that visits all vertices without repeating any, and clarifies that a graph with a Hamiltonian path (without forming a cycle) is not necessarily Hamiltonian. The process of graph closure is detailed. It consists of joining nonadjacent vertices whose sum of degrees is greater than or equal to the number of vertices, recursively until it cannot continue. It is mentioned that the closure is unique for each graph and may or may not be the entire graph. Finally, a distinction is made between Hamiltonian and Eulerian graphs. While an Eulerian graph is one that allows a traversal that passes through all edges only once and returns to the starting point, there is no direct relationship between this and Hamiltonian graphs. It is concluded that despite the apparent similarities between these two types of graphs, their properties and study methods are independent. Author: Jordan Lluch Cristina Course: This video is 37/42 of the Basic Graph Theory and Analysis of 4 Well-Known Problems course | Polytechnic University of Valencia (UPV).    • Curso Teoría básica de grafos y análisis d...   Polytechnic University of Valencia (UPV): https://www.upv.es More videos at:    / valenciaupv   Access our MOOCs: https://upvx.es #Eulerian #Closure #Hamiltonian Path #Hamiltonian Cycle #Hamiltonian #APPLIED MATHEMATICS