Guest Session: 1 Question Remaining.
Create Account
to save progress.
Login
Graph Theory
hard
0:00.0
A graph with
n
n
n
vertices is a complete graph if every vertex has degree:
A
n
n
n
B
n
−
1
n-1
n
−
1
C
1
D
n
/
2
n/2
n
/2
Submit Answer