1. Suppose that T is a tree. We can turn T into a rooted tree by...
Fantastic news! We've Found the answer you've been seeking!
Question:
Transcribed Image Text:
1. Suppose that T is a tree. We can turn T into a rooted tree by designating one of the vertices to be the root. Show, that different choices of root may turn the same tree into a rooted tree of height 5 or of height 9. 2. Suppose T is a tree with the property that each vertex of T either has degree 1 or degree 5. Show that the number of vertices of T cannot be a multiple of 4. 3. Each of the following proofs has (at least one) flaw in its reasoning. Identify the flaw in the reasoning. Note that when we say a flaw in the reasoning, the flaw must occur within the proof of the claim, and not in the claim itself ¹. Some of these claims are true, and some of them are false - but all of the proofs are flawed. (a) Claim: A graph G cannot have an odd number of vertices of degree 5. Proof: If there are 2k + 1 vertices of degree 5, then the sum of their degrees is 5(2k +1) = 10k + 5 which is an odd number. But the sum of the degrees of vertices in a graph must be even, so this is impossible. (b) Claim: Suppose G is a graph with three vertices of degree 2, one vertex of degree 3, and three vertices of degree 1. Then G must be a tree. Proof: The sum of the degrees of G is 2 x 3+3 x 1+1 x 3 = 12, and therefore there are six edges. But there are seven vertices. Because there is one more vertex than there are edges, the graph is a tree: we've seen that any tree with n vertices must have n-1 edges. (c) Claim: If n is an integer such that n² % 32 = 16, then n³ % 32 = 0. Proof: n² % 32 = 16, so we have n² = 16(mod 32), and therefore n = 4(mod 32). But then n³ = 4³ (mod 32), which means n³ = 64(mod 32)), so n³ = 0(mod 32), and hence n³ % 32 = 0. (d) Claim: The largest positive integer ends in 0. Proof: Suppose that k is a positive integer. We will show that if k does not end in zero, then it cannot be the largest positive integer (and therefore that the largest positive integer must end in 0). For if k does not end in 0, consider 10k. This integer does end in 0, because it is a multiple of 10, and is also larger than k. Therefore the largest positive integer must end in 0. 4. Give a direct proof to show that if n is an integer such that 4n = 20 (mod 32), then n² = -7 (mod 16). 5. Give a direct proof to show that if n is an integer such that n divides 12 and n divides 8, then n also divides 4. 1. Suppose that T is a tree. We can turn T into a rooted tree by designating one of the vertices to be the root. Show, that different choices of root may turn the same tree into a rooted tree of height 5 or of height 9. 2. Suppose T is a tree with the property that each vertex of T either has degree 1 or degree 5. Show that the number of vertices of T cannot be a multiple of 4. 3. Each of the following proofs has (at least one) flaw in its reasoning. Identify the flaw in the reasoning. Note that when we say a flaw in the reasoning, the flaw must occur within the proof of the claim, and not in the claim itself ¹. Some of these claims are true, and some of them are false - but all of the proofs are flawed. (a) Claim: A graph G cannot have an odd number of vertices of degree 5. Proof: If there are 2k + 1 vertices of degree 5, then the sum of their degrees is 5(2k + 1) = 10k +5 which is an odd number. But the sum of the degrees of vertices in a graph must be even, so this is impossible. (b) Claim: Suppose G is a graph with three vertices of degree 2, one vertex of degree 3, and three vertices of degree 1. Then G must be a tree. Proof: The sum of the degrees of G is 2 x 3 + 3 x 1+1 x 3 = 12, and therefore there are six edges. But there are seven vertices. Because there is one more vertex than there are edges, the graph is a tree: we've seen that any tree with n vertices must have n-1 edges. (c) Claim: If n is an integer such that n² % 32 = 16, then n³ % 32 = 0. Proof: n² % 32 = 16, so we have n² = 16(mod 32), and therefore n = 4(mod 32). But then n³ = 4³ (mod 32), which means n³ = 64(mod 32)), so n³ = 0(mod 32), and hence n³ % 32 = 0. (d) Claim: The largest positive integer ends in 0. Proof: Suppose that k is a positive integer. We will show that if k does not end in zero, then it cannot be the largest positive integer (and therefore that the largest positive integer must end in 0). For if k does not end in 0, consider 10k. This integer does end in 0, because it is a multiple of 10, and is also larger than k. Therefore the largest positive integer must end in 0. 4. Give a direct proof to show that if n is an integer such that 4n = 20 (mod 32), then n² = -7 (mod 16). 5. Give a direct proof to show that if n is an integer such that n divides 12 and n divides 8, then n also divides 4. 1. Suppose that T is a tree. We can turn T into a rooted tree by designating one of the vertices to be the root. Show, that different choices of root may turn the same tree into a rooted tree of height 5 or of height 9. 2. Suppose T is a tree with the property that each vertex of T either has degree 1 or degree 5. Show that the number of vertices of T cannot be a multiple of 4. 3. Each of the following proofs has (at least one) flaw in its reasoning. Identify the flaw in the reasoning. Note that when we say a flaw in the reasoning, the flaw must occur within the proof of the claim, and not in the claim itself ¹. Some of these claims are true, and some of them are false - but all of the proofs are flawed. (a) Claim: A graph G cannot have an odd number of vertices of degree 5. Proof: If there are 2k + 1 vertices of degree 5, then the sum of their degrees is 5(2k +1) = 10k + 5 which is an odd number. But the sum of the degrees of vertices in a graph must be even, so this is impossible. (b) Claim: Suppose G is a graph with three vertices of degree 2, one vertex of degree 3, and three vertices of degree 1. Then G must be a tree. Proof: The sum of the degrees of G is 2 x 3+3 x 1+1 x 3 = 12, and therefore there are six edges. But there are seven vertices. Because there is one more vertex than there are edges, the graph is a tree: we've seen that any tree with n vertices must have n-1 edges. (c) Claim: If n is an integer such that n² % 32 = 16, then n³ % 32 = 0. Proof: n² % 32 = 16, so we have n² = 16(mod 32), and therefore n = 4(mod 32). But then n³ = 4³ (mod 32), which means n³ = 64(mod 32)), so n³ = 0(mod 32), and hence n³ % 32 = 0. (d) Claim: The largest positive integer ends in 0. Proof: Suppose that k is a positive integer. We will show that if k does not end in zero, then it cannot be the largest positive integer (and therefore that the largest positive integer must end in 0). For if k does not end in 0, consider 10k. This integer does end in 0, because it is a multiple of 10, and is also larger than k. Therefore the largest positive integer must end in 0. 4. Give a direct proof to show that if n is an integer such that 4n = 20 (mod 32), then n² = -7 (mod 16). 5. Give a direct proof to show that if n is an integer such that n divides 12 and n divides 8, then n also divides 4. 1. Suppose that T is a tree. We can turn T into a rooted tree by designating one of the vertices to be the root. Show, that different choices of root may turn the same tree into a rooted tree of height 5 or of height 9. 2. Suppose T is a tree with the property that each vertex of T either has degree 1 or degree 5. Show that the number of vertices of T cannot be a multiple of 4. 3. Each of the following proofs has (at least one) flaw in its reasoning. Identify the flaw in the reasoning. Note that when we say a flaw in the reasoning, the flaw must occur within the proof of the claim, and not in the claim itself ¹. Some of these claims are true, and some of them are false - but all of the proofs are flawed. (a) Claim: A graph G cannot have an odd number of vertices of degree 5. Proof: If there are 2k + 1 vertices of degree 5, then the sum of their degrees is 5(2k + 1) = 10k +5 which is an odd number. But the sum of the degrees of vertices in a graph must be even, so this is impossible. (b) Claim: Suppose G is a graph with three vertices of degree 2, one vertex of degree 3, and three vertices of degree 1. Then G must be a tree. Proof: The sum of the degrees of G is 2 x 3 + 3 x 1+1 x 3 = 12, and therefore there are six edges. But there are seven vertices. Because there is one more vertex than there are edges, the graph is a tree: we've seen that any tree with n vertices must have n-1 edges. (c) Claim: If n is an integer such that n² % 32 = 16, then n³ % 32 = 0. Proof: n² % 32 = 16, so we have n² = 16(mod 32), and therefore n = 4(mod 32). But then n³ = 4³ (mod 32), which means n³ = 64(mod 32)), so n³ = 0(mod 32), and hence n³ % 32 = 0. (d) Claim: The largest positive integer ends in 0. Proof: Suppose that k is a positive integer. We will show that if k does not end in zero, then it cannot be the largest positive integer (and therefore that the largest positive integer must end in 0). For if k does not end in 0, consider 10k. This integer does end in 0, because it is a multiple of 10, and is also larger than k. Therefore the largest positive integer must end in 0. 4. Give a direct proof to show that if n is an integer such that 4n = 20 (mod 32), then n² = -7 (mod 16). 5. Give a direct proof to show that if n is an integer such that n divides 12 and n divides 8, then n also divides 4.
Expert Answer:
Answer rating: 100% (QA)
The claim in the image is that a graph G cannot have an odd number of vertices of degree 5 This is t... View the full answer
Related Book For
Introduction to Algorithms
ISBN: 978-0262033848
3rd edition
Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest
Posted Date:
Students also viewed these algorithms questions
-
Consider a user who needs to transmit 1 . 5 gigabytes of data to a server. The user lives in a small town where only dial - up access is available. A bus visits the small town once a day from the...
-
Planning is one of the most important management functions in any business. A front office managers first step in planning should involve determine the departments goals. Planning also includes...
-
List three specific parts of the Case Guide, Objectives and Strategy Section (See below) that you had the most difficulty understanding. Describe your current understanding of these parts. Provide...
-
Consider the agency relationship in malpractice cases under a contingency fee system. The plaintiff (party that sues) typically pays his or her attorney about one-third of any monetary damages that...
-
A farsighted person uses glasses with a refractive power of 3.6 diopters. The glasses are worn 2.5 cm from his eyes. What is this person's near point when not wearing glasses?
-
There is no initial energy stored in the circuit in Figure P10-41. (a) Transform the circuit into the \(s\) domain and formulate node-voltage equations. (b) Show that the solution of these equations...
-
Suppose you are fired because you would not "cook the books." Do you have any regress? Check out some whistle-blowers websites, especially the Office of Special Counsel.
-
Alabama Airlines opened its doors in June 1995 as a commuter service with its headquarters and only hub located in Birmingham. A product of airline deregulation, Alabama Air joined the growing number...
-
Blue Ridge Marketing Inc. manufactures two products, A and B.Presently, the company uses a single plantwide factory overheadrate for allocating overhead to products. However, management isconsideri 2...
-
The Silver Star Bicycle Company will be manufacturing mens and womens models of its Easy-Pedal 10-speed bicycle during the next two months, and the company would like a production schedule indicating...
-
Your instructor has provided a list of companies that are being evaluated in your classroom this semester. Select one of these companies, Dick's Sporting Goods, and examine the financial statements...
-
. 1.what is internet of things and how they coutribute to big data? 2.How you can ensure that your database is completely secured against all types of therese 3. Identify the five security...
-
If we have 5 servers, how many messages will be sent using a complete server to server communication protocol? Column family Bs use the key-value paradigm but with column name instead of key. True or...
-
What type of paper should be used to get a straight line for the following equations? Show the mathematical justification for your choice. (a)P = 3.7Q 2 (b) Z = 4.62 * 5.13t (c)y = 5.81e 3.6 X
-
3. Evaluate .3 Xx dx. x2 9 Hint: Try the problem twice: Once with trigonometric substitution, and a second time try substituting u = x-9. This trick would also work on dx, but would not work on 9 x2...
-
SQL code USING: https://data.stackexchange.com/math/query/edit/1677831#resultSets Approximately how many posts were made on November 11th, 2021? Select the answer that is closest to the correct...
-
Raul worked for Townsend Industries developing secret genetic testing equipment to sell to hospitals and research facilities. In a financial bind, Raul sold some of the plans for the newest...
-
If your school has a subscription to the FASB Codification, go to aaahq.org/ ascLogin.cfm to log in and prepare responses to the following. (a) What is the stock dividend? (b) What is a stock split?...
-
Suppose we want to create a random sample of the set {1, 2, 3, . . . , n}, that is, an m-element subset S, where 0 m n, such that each m-subset is equally likely to be created. One way would be to...
-
Given a list of values z 0 , z 1 , . . . ,z n - 1 (possibly with repetitions), show how to find the coefficients of a polynomial P(x) of degree-bound n + 1 that has zeros only at z 0 , z 1 , . . . ,z...
-
Write an iterative version of RANDOMIZED-SELECT.
-
On February 17,2002, a public accountant completed the examination of the financial statements for Buckheizer Corporation for the year ended December 31,2001. The audit is satisfactory in all...
-
Explain what action an auditor should take when a client tells the auditor that the company has changed from straight-line to accelerated amortization. Also explain what action an auditor should take...
-
What is meant by "going concern consideration"? Provide an example of such a condition and describe how it might be appropriately disclosed in the financial statements.
Study smarter with the SolutionInn App