Explanation Given: d 1 , d 2 ,.. ., d n arenpositive integers with sum 2n- 2. Proof: LetP(n) be “there exists a tree that hasnvertices and the degrees of the vertices ared 1 , d 2 ,.. ., d n ” Forn = 2 The sum of the two integersd 1 , d 2 has to be equal to 2n − 2 = 4 − 2 = 2. Since both integers have to be positive, they then both have to be equal to 1. d 1 , d 2 , = 1 The tree of height 1 with an edge between a root and one child is then a tree with two vertices and the degree of the two vertices is 1 each. Thus,P(1) is true. Let P(k) be true, thus there exists a tree that haskvertices and the degrees of the vertices ared 1 , d 2 ,.. ., d k . We need to prove that P(k + 1 ) is true. Let k be greater than 1. Let d 1 , d 2 ,.. ., d k , d k + 1 equal to 1 (because if allk+ 1 integers are at least 2, then their sum is 2(k + 1) =2k+ 2 ) Let d k + 1 = 1 At least one of the other positive integers then has to be greater than 1 (because if allk+ 1 integers are 1, then their sum isk+ 1, which is smaller than2k...

8th Edition

ISBN: 9781260521337

Author: ROSEN

Publisher: MCG

See similar textbooks

Videos

Question

Chapter 11, Problem 6SE

To determine

To prove:

there is a tree that hasnvertices such that the degrees of these vertices are d₁ , d₂ ,.. ., d_n.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 11, Problem 5SE

Chapter 11, Problem 7SE

Students have asked these similar questions

71. Show that the number of planted plane trees on 2n vertices, 2m+1 of which have even number of upward branches is 1 2n 2n + m 1 2n (2m + 1

5. Can somcone cross all the bridges shown in this map cxactly once and return to the starting point?

Construct a preimage with vertices at (-7, 7), (-9, 3), (-3, 7), and (-5, 3). Create an image by reflecting this figure over the x-axis.

Chapter 11 Solutions

DISCRETE MATHEMATICS+ITS APPL. (LL)-W/A

Ch. 11.1 - Prob. 1E Ch. 11.1 - Vhich of these graphs are trees?Ch. 11.1 - Prob. 3E Ch. 11.1 - Prob. 4E Ch. 11.1 - Prob. 5E Ch. 11.1 - Prob. 6E Ch. 11.1 - Prob. 7E Ch. 11.1 - Prob. 8E Ch. 11.1 - Prob. 9E Ch. 11.1 - Prob. 10E

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.

To prove: there is a tree that hasnvertices such that the degrees of these vertices are d 1 , d 2 ,.. ., d n .

Solution Summary: The author proves that P(k) is true, since both integers have to be positive, and the degree of the two vertices is 1 each.

Videos

To prove:

there is a tree that hasnvertices such that the degrees of these vertices are d₁ , d₂ ,.. ., d_n.

Want to see the full answer?

Chapter 11 Solutions

To prove: there is a tree that hasnvertices such that the degrees of these vertices are d 1 , d 2 ,.. ., d n .

Solution Summary: The author proves that P(k) is true, since both integers have to be positive, and the degree of the two vertices is 1 each.

Videos

To prove: there is a tree that hasnvertices such that the degrees of these vertices are d1 , d2 ,.. ., dn.

Want to see the full answer?

Chapter 11 Solutions

To prove:

there is a tree that hasnvertices such that the degrees of these vertices are d₁ , d₂ ,.. ., d_n.