Across
- 3. An efficient method of representing a graph in which many vertex pairs are connected by edges
- 5. A type of graph which has labelled edges
- 8. A connected undirected graph with no cycles
- 9. A problem in which the solution finds a route that travels each path once before returning to the starting point
Down
- 1. A type of undirected graph without multiple edges. In this type of graph, each edge connects two different vertices
- 2. A diagram consisting of vertices joined by edges; each edge joins exactly two vertices
- 4. Two vertices joined by an edge
- 6. Number of neighbours of a vertex
- 7. Directed graph
- 10. A type of tree in which one vertex is the root and every edge is directed away from the root