Problem #PRU-30784

Problems Discrete Mathematics Graph Theory
 12–13  2.0

Problem

Prove that a graph, in which every two vertices are connected by exactly one simple path, is a tree.