Skip to content
Home
Path
Worksheets
Skill map
Leaderboard
Sign in
Save your progress
Search topics
Ctrl K
Sign in
Save your progress
Search
1 of 8
0-day streak
Sound: off
Lesson
Practice
Trees and spanning trees
DIFFICULTY
intro
standard
challenge
exam
Question 1 of 8
Calculator allowed
Four undirected graphs are listed below
1 mark
Which candidate is a tree?
Candidate graph. Vertices in listed order: [A | F | B | C | D]. Full edge list: C–D; B–C; A–D; F–D; A–F.
A
F
B
C
D
Candidate graph. Vertices in listed order: [A | F | B | C | D]. Full edge list: C–D; B–C; A–D; F–D; B–C.
A
F
B
C
D
Candidate graph. Vertices in listed order: [A | F | B | C | D]. Full edge list: C–D; A–D; F–D.
A
F
B
C
D
Candidate graph. Vertices in listed order: [A | F | B | C | D]. Full edge list: C–D; B–C; A–D; F–D.
A
F
B
C
D
CHECK
Show solution