Graphs and Networks #2

1. A vertex that is not connected to any other vertex
3. A point in a graph that represents an object
5. A trail that starts and ends at the same vertex
8. A route through a graph from one vertex to another along the edges
10. A line in a graph that connects two vertices
11. A graph that has no isolated vertices and no separate parts
15. A graph that has numbers associated with its edges
17. A graph that can be drawn so that no two edges cross over
18. An edge that connects a vertex to itself
21. A square matrix that records the number of edges connecting each pair of vertices
22. A diagram that shows the connections between objects
24. The number of edges attached to a vertex

2. A graph with directions associated with the edges
4. An open path that visits every vertex of the graph
6. A graph that does not have any loops or multiple edges
7. A walk that has no repeated edges
9. An edge that if removed would leave the graph no longer connected
10. A closed trail that involves every edge of the graph
12. A walk that starts and ends at different vertices
13. A walk that starts and ends at the same vertex
14. A closed path that visits every vertex of the graph
16. A closed path
19. A walk that has no repeated edges AND no repeated vertices
20. A weighted graph where the weights represent physical quantities such as distance time or cost
23. An area in a graph enclosed between edges