Using the graph below, determine if the sequence of vertices describes a Hamilton path (H.P.), a Hamilton circuit (H.C.), or neither.
Table of contents
- 1. Critical Thinking & Problem Solving1h 59m
- 2. Sets4h 25m
- 3. Logic4h 33m
- 4. Numeration Systems3h 14m
- 5. The Real Number System3h 5m
- 6. Algebra Review8h 53m
- Evaluating Algebraic Expressions15m
- Simplifying Algebraic Expressions1h 2m
- Linear Equations38m
- Direct & Inverse Variation27m
- Linear Inequalities in One Variable41m
- Quadratic Equations1h 24m
- Rectangular Coordinate System28m
- Intro to Functions and Notation29m
- Domain and Range10m
- Using Intercepts to Graph Lines4m
- Slope and Slope-Intercept Form1h 8m
- Systems of Linear Equations1h 25m
- Systems of Linear Inequalities37m
- 10. Geometry3h 37m
- 11. Voting and Apportionment3h 3m
- 12. Graph Theory3h 1m
12. Graph Theory
Hamilton Paths and Hamilton Circuits
Multiple Choice
Determine if the graph must have Hamilton circuits. If so, how many?
Note: We will be using the formula below.

Complete? ☐
# of vertices: ___
# of Hamilton circuits: ___
A
Complete? Yes; # of vertices: 60; # of Hamilton circuits: 6
B
Complete? No; # of vertices: 60; # of Hamilton circuits: 6
C
Complete? Yes; # of vertices: 6; # of Hamilton circuits: 120
D
Complete? Yes; # of vertices: 6; # of Hamilton circuits: 60
0 Comments
Related Videos
Related Practice
Multiple Choice

