Topological Graph Theory
Casual Mode - Take your time!
1 / 15
Correct
0
Incorrect
0
Score
0%
Multiple Choice
In graph theory, a path is a sequence of vertices such that consecutive vertices are connected by edges. What is the maximum number of edges in a path with n vertices?
- n-1
- n
- n+1
- 2n