Graph Theory Vocabulary

Edit Answers
1234567891011121314151617
Across
  1. 1. Another word for a network.
  2. 7. A --- is a graph that is made from a subset of the vertices and edges of another graph.
  3. 8. If we are allowed to move in either direction along the edges of a graph, the graph is called ---.
  4. 11. The --- degree of a vertex is the number of edges coming in to the vertex.
  5. 13. A --- is a connected, simple graph with no alternative ways to return to a starting vertex once you 'leave' it.
  6. 14. An undirected graph is --- if it is possible to travel from every vertex to every other vertex by following edges.
  7. 15. The --- degree of a vertex is the number of edges going out from the vertex.
  8. 16. An edge that goes back to the same vertex.
  9. 17. A --- graph has numbers assigned to its edges.
Down
  1. 2. --- vertices are vertices which are connected by an edge. --- edges are edges which share a common vertex.
  2. 3. A --- graph whose vertices can be split into two groups, such that edges only join vertices between the groups and not vertices within the same group.
  3. 4. The --- of a vertex is the number of edges connected to it.
  4. 5. A --- graph a simple undirected graph in which every vertex is connected by an edge to every other vertex.
  5. 6. A line between one vertex to another in a graph.
  6. 7. A graph is called --- if it contains no loops and no 'repeats'.
  7. 9. A --- graph contains arrows indicating the direction we can move along the edges.
  8. 10. A directed graph is --- connected if it is possible to travel from every vertex to every other vertex by following edges in the correct direction.
  9. 12. A point on a graph.