Consider a graph G of 8 vertices containing no self loop. If there is no more than one edge between any pair of vertices, maximum possible number of edges in G are:

Consider a graph G of 8 vertices containing no self loop. If there is

1.	Consider a graph G of 8 vertices containing no self loop. If there is no more than one edge between any pair of vertices, maximum possible number of edges in G are:
A.	8
B.	16
C.	28
D.	64
Answer» D. 64