Networks

Edit Answers
123456789101112
Across
  1. 3. exist if the graph is connected and has exactly two vertices of odd degree
  2. 5. walk with no repeated vertices and no repeated edges
  3. 6. for determining the shortest path through a network from one vertex to another
  4. 7. path (no repeated edges or vertices) that starts and ends at the same vertex
  5. 9. for determining the minimum spanning tree
  6. 11. exist if the graph is connected and has all of the vertices with an even degree
Down
  1. 1. path (no repeated edges or vertices) that includes all of the vertices
  2. 2. sequence of edges, linking successive vertices
  3. 4. a tree that connects every vertex of a graph
  4. 5. no two edges overlap or intersect, except at the vertices
  5. 6. the number times edges attach to a vertex
  6. 8. trail (no repeated edges) that starts and ends at the same vertex
  7. 10. path (no repeated edges nor vertices) that starts and ends at the same vertex
  8. 12. walk with no repeated edges