-
G is an undirected graph with n vertices and 25 edges such that each vertex of G has degree at least 3. Then the maximum possible value of n is _______.
-
- 12
- 16
- 6
- 65
Correct Option: B
If every vertex has degree at least 3 then, the maximum possible value of n
where (n is the vertices), given edge (E) = 25 then, 2(E) ≥ ∑ degree of vertices
(∴ According to undirected graph)
2(E) ≥ 3n
| n ≤ | ||
| 3 |
| n ≤ | ||
| 3 |
n ≤ 16.66
So, n is at Most 16.
Hence 16 is correct answer.
