From complete graph by removing maximum edges, we can construct
Q53595
PYQ UPPSC LT Grade (Assistant Teacher) 2018 recruitment
From a complete graph by removing maximum ______ edges, we can construct a spanning tree.
- A.
e - n + 1
- B.
n - e + 1
- C.
n + e - 1
- D.
e - n - 1
Attempted by 161 students.
Sign up free to check your answer
Sign up freeLoading lesson…