D1 key terms

?

1. Digraph

  • A connected graph with no cycles
  • A tree that connects all the vertices (n) of any graph. Has (n-1) edges
  • Edges have a direction associated with them
  • The number of edges connected to a vertex (loops count as two)
1 of 20

Other questions in this quiz

2. Fully connected

  • All vertices are joined at least once to every other vertex
  • A spanning tree of a minimum weight for a network
  • Starts and ends at different points but still uses every edge once
  • A connected graph with no cycles

3. Semi-Eulerian

  • A graph with no loops and, at most, one edge connects any pair of vertices
  • A sequence of edges that only includes edges once
  • Starts and ends at different points but still uses every edge
  • Edges have a direction associated with them

4. Disconnected

  • A finite number of points connected by lines
  • An edge that starts and ends at the same vertex
  • You can't always get from any vertex to any other
  • A sequence of edges that only uses edges once

5. Graph

  • A sequence of edges that only include edges once
  • A finite number of points connected by lines
  • The number of edges connected to a vertex
  • The points on a graph
View more questions

Comments

No comments have yet been made

Similar Mathematics resources:

See all Mathematics resources »See all Networks, algorithms and problem solving resources »