Problem #PRU-78266

Graph Theory

Problem

Given \(n\) points that are connected by segments so that each point is connected to some other and there are no two points that would be connected in two different ways. Prove that the total number of segments is \(n - 1\).