A tree has 2 n vertices of degree 1,3 n vertices of degree 2, n vertices of degree 3 . Determine the number of vertices and edges in tree.
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: A. 12,11
Explanation
There are 6n vertices and 6n − 1 edges. Sum of degrees = 2n + 6n + 3n = 11n = 2(6n − 1), so n = 2: 12 vertices and 11 edges.
More Discrete Structures and Optimization questions
- How many reflexive relations are there on a set with 4 elements?
- Using a^(2c) mod n = (a^c)² mod n and a^(2c+1) mod n = a·(a^c)² mod n, for a = 7, b = 17 and n = 561, what is a^b mod n?
- A clique in an undirected graph is a V ′ ⊆ V subset of vertices, such that u, v) ∈ E u ∈ V ′ v ∈ V ′
- Consider the following statements: S : ∀xP(x) ∨ ∀xQ(x) 1 and ∀x(P(x) ∨ Q(x)) are not logically equivalent. S : ∃xP(x) ∧ ∃xQ(x) 2 and ∃x(P(x…
- Consider the following statements : S (G, *) a ∈ G 1 : If a group is of order n, and is am = e m ≤ n such that for some integer , then m mu…
- Consider the following statements with respect to duality in LPP : (a) The final simplex table giving optimal solution of the primal also c…