What is the maximum degree of a vertex in a tree?

2

3

1

2

What is the minimum number of edges in a connected graph with n vertices?

n-1

n

n-2

n-1

n

n(n-1)

n(n-1)/2

n+1

A graph whose vertices can be divided into two disjoint sets

A graph with only one vertex

A graph with no edges

A graph with negative weights

A graph where there is a path between every pair of vertices

A graph where vertices are not connected

A graph with no edges

A graph with only one vertex