AI Tutor
Back to Trees

Exercise 1

Avg difficulty 2.5

Which of the following graphs are trees?

  1. G=(V,E)G = (V, E) with V={a,b,c,d,e}V = \{a, b, c, d, e\} and E={{a,b},{a,e},{b,c},{c,d},{d,e}}E = \{\{a, b\}, \{a,e\}, \{b, c\}, \{c,d\}, \{d,e\} \}

  2. G=(V,E)G = (V, E) with V={a,b,c,d,e}V = \{a, b, c, d, e\} and E={{a,b},{b,c},{c,d},{d,e}}E = \{\{a, b\}, \{b, c\}, \{c,d\}, \{d,e\}\}

  3. G=(V,E)G = (V, E) with V={a,b,c,d,e}V = \{a, b, c, d, e\} and E={{a,b},{a,c},{a,d},{a,e}}E = \{\{a, b\}, \{a, c\}, \{a,d\}, \{a,e\}\}

  4. G=(V,E)G = (V, E) with V={a,b,c,d,e}V = \{a, b, c, d, e\} and E={{a,b},{a,c},{d,e}}E = \{\{a, b\}, \{a, c\}, \{d,e\}\}

Levin, Discrete Mathematics: An Open Introduction (3rd ed.), §5.2 Trees, Exercise 1

AI Tutor

Adapted from Discrete Mathematics: An Open Introduction © 2013–2019 Oscar Levin. Licensed under CC BY-SA 4.0. Source: Discrete Mathematics: An Open Introduction. Imported at revision 1e2e26b.