Graph Theory Crossword
                                
                                
                                
                                
                                
                                
                                
                                
                                
                                
                                
                                
                                
                                
                                
                                
                                
                                
                                
                                
                                
                                
                                
                                
                                
                                
                                
 
 
Down: 1) Go vertex to vertex using simple criterion: Where is the next "nearest" place to go to?3) An edge that if erased will be disconnected from the graph.5) A vertex of odd degree.6) A path that passes through every vertex of the graph.7) The process of changing a graph by adding additional edges so that odd vertices are eliminated.8) Start by grabbing the cheapest edge of the graph, and continue without allowing circuits to form and not allowing 3 edges to come together at a vertex.9) An algorithm for which the number of steps needed to carry it out grows disproportionately with the size of the problem.13) A circuit that does not require you to end back at the point you started.15) Lines. Across: 2) Dots.4) A circuit that travels through every edge of a graph.10) Checking through all possible Hamilton circuits to find the optimal one.11) More than one edge connecting the same two vertices.12) A circuit that must visit each vertex of the graph, once and only once.14) Variation the the nearest-neighbor algorithm in which you repeat it several times.16) Picture consisting of vertices and edges.17) Any two vertices of a graph that can be joined by a path.18) When an edge connects a vertex back with itself.19) A sequence of vertices with the property that each vertex in the sequence is adjacent to the next one.20) A path that travels through every edge of a graph.
 

 

Create your own Crossword Puzzle for Free!		  Show Errors as I Type