Which of the following graphs are trees? (see figure)
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: A. (A) and (B) only
Explanation
A tree on 6 vertices is connected with exactly 5 edges and no cycle. Graphs (A) and (B) each have 5 edges and connect all six vertices. (C) contains a cycle, and (D) has only 4 edges so it is disconnected.
More Discrete Structures and Optimisation questions
- Match List I with List II. List I: (A) ∅ ∩ {∅} = (B) {∅} ∩ {∅} = (C) {∅, {∅}} − ∅ = (D) ∅ ∪ {{∅}} =. List II: (I) ∅ (II) {∅} (III) {{∅}} (I…
- Match List - I with List - II.
- Arrange the following in ascending order: (a) remainder of 49¹⁶ divided by 17 (b) remainder of 24⁴⁶ divided by 9 (c) remainder of 155¹⁷ div…
- Given below are two statements : Statement (I): If H is a nonempty finite subset of ∈ ∀ ∈ a group G and ab H a,b H then H is also a group S…
- The cost function of total food is:
- Which of the following constraints when formulating the LPP?