Q. In any directed graph if all edges are reciprocal, can have maximum of |E|= (Solved)

1. 1

2. 0

3. 2

4. None of the above

  • c. 2
Subscribe Now

Get All Updates & News