Graph Theory

3. a circuit that uses every edge in a graph exactl once
7. a type of graph where every vertex is connected to every other vertex
10. an edge that begins and ends at the same vertex
12. a junction point that connects three edges such that they all form 120˚ angles
13. a connected subgraph that includes every vertex of the original graph with no circuits
14. a sequence of connected edges that begin and end at different points

1. two vertices with more that one edge between them
2. a sequence of connected edges that begin and end at the same point
4. a path that uses every edge in a graph exactly once
5. a path that travels to every vertex in a graph exactly once
6. a circuit that travels to every vertex in a graph exactly once, but returns to the starting vertex
8. the least expensive spanning tree in a graph
9. an edge whose removal causes a disconnect in a graph
11. the number of times a vertex is touched by an edge