NETWORKS

2. A type of graph made up of all isolated vertices
8. A type of graph that includes arrows on edges to indicate direction or flow of movement
10. A type of trail that travel every edge in a graph exactly once
11. Edges can’t be repeated, vertices may be repeated
12. A type of graph that does not have included directions on their edges
16. A type of graph that contains no new vertices or edges that don’t appear in the original graph
19. A route between one vertex and another
22. An edge that if removed, would make a graph disconnected
23. A type of path that travels every vertex in the graph only once
24. A diagram that consists of vertices and edges
26. A type of graph where every vertex is connected to every other vertex directly
27. A graph where every vertex is connected to another vertex by one or more edges
29. The number of edges taken to get from one vertex to another
30. When an edge joins a vertex to itself

1. A walk that starts and stops at the same vertex
3. A closed trail
4. A walk that starts and stops at different vertices
5. The number of edges which touch a vertex. Can be odd or even
6. When vertices can be split into two distinct groups
7. A graph that is a non-directed, connected graph that can be drawn without any of its edges crossing
9. A type of graph where all vertices have the same degree
13. A graph where at least one vertex is not connected
14. Edges and vertices can be repeated
15. A formula to verify if a simple connected graph is planar
17. Edges and vertices can’t be repeated
18. A type of vertex that is not connected to any other vertex
19. A type of graph where edges are labelled with a number
20. A type of graph that contains no loops or multiple edges
21. A type of graph with only one vertex
25. A type of edge that is directed
26. A closed path
28. A graph that represents a real-life scenario