Multiple choice general knowledge science & technology

How many edges are there in a completely connected simple graph(a simple graph is one with no loops or cycles)

  1. n*(n-1)/2

  2. n*(n-3)/2

  3. n*n

  4. n*(n-2)/3
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

In a complete graph with n vertices, each vertex connects to (n-1) others. Total connections counted this way = n*(n-1). Each edge is counted twice (once from each endpoint), so actual edges = n*(n-1)/2. Option A is correct.

Keep practicing — related questions