Question

Number of distinct graphs with p vertices and q edges ( p not equal to q) is always equal to

a) p

b) q

c)min(p,q)

d)max (p,q)

e) none of this

Answer 1

I think, None of this should be answer for this question. total no of distinct graphs will be
p(p-1)/2 C q

Comments

any reference for it??

---

It is obvious. With p vertices $p(p-1)/2\;$ maximum edges possible. Out of which we have to select q edges.