MCQ Subject: Discrete Mathematics & Graph Theory

A graph with 10 vertices is connected. What is the minimum number of edges required to ensure it remains connected without forming any cycles?

What is the maximum number of edges in an undirected simple graph with 8 vertices?

A tree with 10 vertices must have how many edges to remain a tree?