Consider G = (V, E) where no edge in E is a self-loop (i.e., Ve E...

 

Transcribed Image Text:

Consider G = (V, E) where no edge in E is a self-loop (i.e., Ve E E, VvE V, e ‡ {v, v}.). If |E| = 0, the number of connected components is? (Hint: in terms of n = |V.) Enter your answer here If E = m, where m <n, the minimum number of connected components is? (Hint: in terms of n = |V. and m = E.) Enter your answer here Consider G = (V, E) where no edge in E is a self-loop (i.e., Ve E E, VvE V, e ‡ {v, v}.). If |E| = 0, the number of connected components is? (Hint: in terms of n = |V.) Enter your answer here If E = m, where m <n, the minimum number of connected components is? (Hint: in terms of n = |V. and m = E.) Enter your answer here