🎴 Flashcard Mode
Topological Graph Theory
Card1 / 15
Mastered0
Review0
QuestionClick to flip
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?
AnswerClick to flip back
A
n-1
💡 Explanation:
A path with n vertices can have at most n-1 edges, as each edge connects two vertices.