Chap 15 Vocab Crossword

consists of finite set of points
an edge begins and ends at the same vertex
same vertices connected in the same way
number of edges emanating from a vertex
even number coming from a vertex
odd numbers coming from a vertex
have at least one edge connecting them
sequence of adjacent vertices and edges connecting them
begins and ends at the same vertex
any two vertices, there is at least one path that connects them
graph is not connected
if removed, the graph is disconnected
path passes through each edge exactly once
circuit that passes through each edge exactly once
passes through vertex exactly once
begins and ends at the same vertex
graph that has an edge connecting every pair of vertices
shortest route
edges labeled with quantity of interest
any two vertices are connected by one path
any removal of edges
smallest possible sum of weights