JEST 2019

Question

A directed graph with n vertices, in which each vertex has exactly 3 outgoing edges. Which one is true?

A) All the vertices have indegree = 3 .

B) Some vertices will have indegree exactly 3.

C)Some vertices have indegree atleast 3.

D) Some of the vertices have indegree atmost 3

Comments

repeated question

https://gateoverflow.in/19248/tifr2010-b-36

---

what will be the answer? @Arjun Sir

I got both C & D as the answer by drawing many di-graphs with each vertex has exactly 3 outgoing edges.