Which of the following graphs (on vertices a–f) are trees?
(A) edges: ac, bc, cd, cf, ef
(B) edges: ac, af, df, ef, be
(C) edges: ab, ac, ad, be, cf, de
(D) edges: af, be, bd, ce
Choose the correct answer from the options given below:
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. A and B are connected with 5 edges, so they are trees. C has 6 edges and a cycle a-b-e-d-a. D has only 4 edges and is disconnected.More Discrete Structures and Optimization questions
- Match List I with List IIList I List II (A) φ ∩ {φ} (I) φ (B) {φ} ∩ {φ} (II) {φ} (C) {φ, {φ}} − φ (III) {{φ}} (D) φ ∪ {{φ}} (IV) {φ, {φ}}
- Match List I with List II (logically equivalent expressions)List I List II (a) P ∧ (P → Q) (I) P ∨ Q (b) ¬(P ∨ Q) → (P ∧ Q) (II) (P ∧ ¬P) ∨…
- Arrange the following in ascending order: (a) Remainder of 4916 when divided by 17 (b) Remainder of 2446 when divided by 9 (c) Remainder of…
- Statement (I): If H is a non-empty finite subset of a group G and ab ∈ H for all a, b ∈ H, then H is also a group. Statement (II): There is…
- The cost function of the total food is:
- Which of the following are the constraints when formulating the LPP?