Topics of this game:
- Using the graph from Slide #2, the correct number of loops is in what range?
- Using the graph from Slide #2, the correct degree of U is in what range?
- Using the graph from Slide #2, the correct number of bridges is in what range?
- Using the graph from Slide #2, which is possible? An Euler Circuit, an Euler Path, or Neither?
- Using the graphs from slide #3, determine if the graphs are equivalent or not equivalent.
- For a complete graph with 204 vertices, how many edges are there?
- The Brute Force Algorithm can best be described as:
- Which of the following could be a text representation of a Hamilton Path for a graph with 8 vertices?
- An optimal and efficient algorithm for finding Hamilton Circuits for completed weighted graphs:
- Which of the following is a characteristic of a complete graph?
