In a complete undirected graph consisting of 3 vertices, how many total adjacencies will there be?
A) 2
B) 6
C) 9
D) 4

Name: In a complete undirected graph consisting of 3 vertices, how many total adjacencies will there be? A) 2 B) 6 C) 9 D) 4
Brand: Quizplus
Rating: 4.9 (36 reviews)

Question

Quizplus · Accepted Answer

In a complete undirected graph with n vertices, there are n*(n-1)/2 adjacencies. For a graph with 3 vertices, this formula gives 3*(3-1)/2 = 3*2/2 = 6 adjacencies.

In a Complete Undirected Graph Consisting of 3 Vertices, How