Computer-Graphics
November 29, 2023Cyrus-Beck-Algorithm
November 29, 2023Question 5933 – UGC NET CS 2009-June-Paper-2
The complete graph with four vertices has k edges where k is :
Correct Answer: D
Question 12 Explanation:
To find number of edges in complete graph using standard formula is n(n-1)/2
n=4
= 4(4-3)/2
= (4*3)/2
= 12/2
= 6
n=4
= 4(4-3)/2
= (4*3)/2
= 12/2
= 6
3
4
5
6