| A. | maximum of n,d |
| B. | n+d |
| C. | nd |
| D. | nd/2 |
Answer : D Explanation :
In a regular graph, all the vertices will be of the same degree. Total degrees of all the vertices is nd. Each edge will be increasing the total degree by 2. So, totally ndl2 edges.
|
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
