A connected undirected graph that has n vertices must have at least ______ edges.
A)n
B)n - 1
C)n / 2
D)n * 2

Name: A connected undirected graph that has n vertices must have at least ______ edges. A)n B)n - 1 C)n / 2 D)n * 2
Brand: Quizplus
Rating: 4.9 (34 reviews)

Question

Quizplus · Accepted Answer

A connected undirected graph with n vertices must have at least n - 1 edges to ensure there is a path between every pair of vertices, which is the minimum requirement for connectivity. This is the case for a tree, which is a minimally connected graph.

A Connected Undirected Graph That Has N Vertices Must Have