True or false: If an undirected graph

$$

G on

$$

n vertices is connected and has at most

$$

$$

$1$

n$1$ edges then

$$

G must be a tree.