Networks
Across
- 2. A sequence of edges linking successive vertices in a graph
- 5. An edge that connects a vertex to itself
- 6. An Euler trail that starts and finishes at the same vertex
- 9. A trail beginning and ending at the same vertex
- 10. A path beginning and ending at the same vertex
- 13. An edge whose deletion would cause the graph to no longer be connected
- 15. Region created by the edges of a network
- 16. A graph where it is possible to walk between all vertices
- 18. A network where all vertices are directly connected with all other vertices with no loops or multiple edges
- 19. A walk with no repeated edges
Down
- 1. A Hamiltonian Path that starts and ends at the same vertex
- 3. Points connected by edges in a network graph
- 4. A path that uses every vertex once
- 7. It has a degree of 0
- 8. A trail that uses every edge exactly once
- 11. Line connecting two vertices
- 12. A walk with no repeated vertices
- 14. Equivalent networks
- 17. A network with no edges