Discrete Mathematics With Applications
5th Edition
ISBN: 9780357035283
Author: EPP
Publisher: Cengage
expand_more
expand_more
format_list_bulleted
Question
Chapter 10.6, Problem 21ES
To determine
(a)
To check:
If
To determine
(b)
To check:
If the graph G in part (a) is simple, then whether
Expert Solution & Answer
Trending nowThis is a popular solution!
Students have asked these similar questions
Suppose you are gambling on a roulette wheel. Each time the wheel is spun, the result is one of the outcomes 0, 1, and so on through 36. Of these outcomes, 18 are red, 18 are black, and 1 is green. On each spin you bet $5 that a red outcome will occur and $1 that the green outcome will occur. If red occurs, you win a net $4. (You win $10 from red and nothing from green.) If green occurs, you win a net $24. (You win $30 from green and nothing from red.) If black occurs, you lose everything you bet for a loss of $6.
a. Use simulation to generate 1,000 plays from this strategy. Each play should indicate the net amount won or lost. Then, based on these outcomes, calculate a 95% confidence interval for the total net amount won or lost from 1,000 plays of the game. (Round your answers to two decimal places and if your answer is negative value, enter "minus" sign.) I worked out the Upper Limit, but I can't seem to arrive at the correct answer for the Lower Limit. What is the Lower Limit?…
4. Consider Chebychev's equation
(1 - x²)y" - xy + λy = 0
with boundary conditions y(-1) = 0 and y(1) = 0, where X is a constant.
(a) Show that Chebychev's equation can be expressed in Sturm-Liouville form
d
· (py') + qy + Ary = 0,
dx
y(1) = 0, y(-1) = 0,
where p(x) = (1 = x²) 1/2, q(x) = 0 and r(x) = (1 − x²)-1/2
(b) Show that the eigenfunctions of the Sturm-Liouville equation are extremals of the
functional A[y], where
A[y]
=
I[y]
J[y]'
and I[y] and [y] are defined by
-
I [y] = √, (my² — qy²) dx
and
J[y] = [[", ry² dx.
Explain briefly how to use this to obtain estimates of the smallest eigenvalue >1.
1
(c) Let k > be a parameter. Explain why the functions y(x) = (1-x²) are suitable
4
trial functions for estimating the smallest eigenvalue. Show that the value of A[y]
for these trial functions is
4k2
A[y] =
=
4k - 1'
and use this to estimate the smallest eigenvalue \1.
Hint:
L₁ x²(1 − ²)³¹ dr =
1
(1 - x²)³ dx
(ẞ > 0).
2ẞ
2. If loga b + log, a = √√29, find all possible values of loga blog, a
Chapter 10 Solutions
Discrete Mathematics With Applications
Ch. 10.1 - Let G be a graph and let v and w be vertices in G....Ch. 10.1 - A graph is connected if, any only if, _____.Ch. 10.1 - Removing an edge from a circuit in a graph does...Ch. 10.1 - An Euler circuit in graph is _____.Ch. 10.1 - Prob. 5TYCh. 10.1 - Prob. 6TYCh. 10.1 - Prob. 7TYCh. 10.1 - If a graph G has a Hamiltonian circuit, then G has...Ch. 10.1 - A travelling salesman problem involves finding a...Ch. 10.1 - In the graph below, determine whether the...
Ch. 10.1 - In the graph below, determine whether the...Ch. 10.1 - Let G be the graph and consider the walk...Ch. 10.1 - Consider the following graph. How many paths are...Ch. 10.1 - Consider the following graph. How many paths are...Ch. 10.1 - An edge whose removal disconnects the graph of...Ch. 10.1 - Given any positive integer n, (a) find a connected...Ch. 10.1 - Find the number of connected components for each...Ch. 10.1 - Each of (a)—(c) describes a graph. In each case...Ch. 10.1 - Prob. 10ESCh. 10.1 - Is it possible for a citizen of Königsberg to make...Ch. 10.1 - Determine which of the graph in 12-17 have Euler...Ch. 10.1 - Determine which of the graph in 12-17 have Euler...Ch. 10.1 - Determine which of the graph in 12-17 have Euler...Ch. 10.1 - Determine which of the graph in 12-17 have Euler...Ch. 10.1 - Determine which of the graph in 12-17 have Euler...Ch. 10.1 - Determine which of the graph in 12-17 have Euler...Ch. 10.1 - Is it possible to take a walk around the city...Ch. 10.1 - For each of the graph in 19-21, determine whether...Ch. 10.1 - Prob. 20ESCh. 10.1 - Prob. 21ESCh. 10.1 - Prob. 22ESCh. 10.1 - Prob. 23ESCh. 10.1 - Find the complement of each of the following...Ch. 10.1 - Find the complement of the graph K4, the complete...Ch. 10.1 - Suppose that in a group of five people A,B,C,D,...Ch. 10.1 - Prob. 27ESCh. 10.1 - Show that at a party with at least two people,...Ch. 10.1 - Find Hamiltonian circuits for each of the graph in...Ch. 10.1 - Find Hamiltonian circuits for each of the graph in...Ch. 10.1 - Prob. 31ESCh. 10.1 - Show that none of graphs in 31-33 has a...Ch. 10.1 - Prob. 33ESCh. 10.1 - Prob. 34ESCh. 10.1 - Prob. 35ESCh. 10.1 - In 34-37, find Hamiltonian circuits for those...Ch. 10.1 - Prob. 37ESCh. 10.1 - Give two examples of graphs that have Euler...Ch. 10.1 - Prob. 39ESCh. 10.1 - Prob. 40ESCh. 10.1 - Give two examples of graphs that have Euler...Ch. 10.1 - A traveler in Europe wants to visit each of the...Ch. 10.1 - a. Prove that if a walk in a graph contains a...Ch. 10.1 - Prob. 44ESCh. 10.1 - Prob. 45ESCh. 10.1 - Prob. 46ESCh. 10.1 - Prove that if there is a trail in a graph G from a...Ch. 10.1 - If a graph contains a circuits that starts and...Ch. 10.1 - Prob. 49ESCh. 10.1 - Let G be a connected graph, and let C be any...Ch. 10.1 - Prob. 51ESCh. 10.1 - Prob. 52ESCh. 10.1 - For what values of n dies the complete graph Kn...Ch. 10.1 - For what values of m and n does the complete...Ch. 10.1 - What is the maximum number of edges a simple...Ch. 10.1 - Prob. 56ESCh. 10.1 - Prob. 57ESCh. 10.2 - In the adjacency matrix for a directed graph, the...Ch. 10.2 - Prob. 2TYCh. 10.2 - Prob. 3TYCh. 10.2 - Prob. 4TYCh. 10.2 - Prob. 5TYCh. 10.2 - Prob. 6TYCh. 10.2 - Find real numbers a, b, and c such that the...Ch. 10.2 - Find the adjacency matrices for the following...Ch. 10.2 - Find directed graphs that have the following...Ch. 10.2 - Find adjacency matrices for the following...Ch. 10.2 - Find graphs that have the following adjacency...Ch. 10.2 - Prob. 6ESCh. 10.2 - Prob. 7ESCh. 10.2 - Prob. 8ESCh. 10.2 - Prob. 9ESCh. 10.2 - Prob. 10ESCh. 10.2 - Prob. 11ESCh. 10.2 - Prob. 12ESCh. 10.2 - Let O denote the matrix [0000] . Find 2 × 2...Ch. 10.2 - Prob. 14ESCh. 10.2 - Prob. 15ESCh. 10.2 - In 14-18, assume the entries of all matrices are...Ch. 10.2 - Prob. 17ESCh. 10.2 - Prob. 18ESCh. 10.2 - Prob. 19ESCh. 10.2 - The following is an adjacency matrix for a graph:...Ch. 10.2 - Let A be the adjacency matrix for K3, the complete...Ch. 10.2 - Draw a graph that has [0001200011000211120021100]...Ch. 10.2 - Prob. 23ESCh. 10.3 - If G and G’ are graphs, then G is isomorphic to G’...Ch. 10.3 - A property P is an invariant for graph isomorphism...Ch. 10.3 - Prob. 3TYCh. 10.3 - For each pair of graphs G and G’ in 1-5, determine...Ch. 10.3 - For each pair of graphs G and G’ in 1-5, determine...Ch. 10.3 - For each pair of graphs G and G’ in 1-5, determine...Ch. 10.3 - For each pair of graphs G and G’ in 1-5, determine...Ch. 10.3 - For each pair of graphs G and G in 1—5, determine...Ch. 10.3 - For each pair of graphs G and G’ in 6-13,...Ch. 10.3 - For each pair of graphs G and G’ in 6-13,...Ch. 10.3 - For each pair of graphs G and G’ in 6-13,...Ch. 10.3 - Prob. 9ESCh. 10.3 - For each pair of graphs G and G’ in 6-13,...Ch. 10.3 - For each pair of graphs G and G’ in 6-13,...Ch. 10.3 - For each pair of simple graphs G and G in 6—13,...Ch. 10.3 - For each pair of graphs G and G’ in 6-13,...Ch. 10.3 - Draw all nonisomorphic simple graphs with three...Ch. 10.3 - Draw all nonisomorphic simple graphs with four...Ch. 10.3 - Prob. 16ESCh. 10.3 - Draw all nonisomorphic graphs with four vertices...Ch. 10.3 - Draw all nonisomorphic graphs with four vertices...Ch. 10.3 - Prob. 19ESCh. 10.3 - Draw four nonisomorphic graphs with six vertices,...Ch. 10.3 - Prob. 21ESCh. 10.3 - Prove that each of the properties in 21-29 is an...Ch. 10.3 - Prob. 23ESCh. 10.3 - Prove that each of the properties in 21-29 is an...Ch. 10.3 - Prob. 25ESCh. 10.3 - Prob. 26ESCh. 10.3 - Prob. 27ESCh. 10.3 - Prove that each of the properties in 21-29 is an...Ch. 10.3 - Prob. 29ESCh. 10.3 - Show that the following two graphs are not...Ch. 10.4 - A circuit-free graph is a graph with __________.Ch. 10.4 - Prob. 2TYCh. 10.4 - Prob. 3TYCh. 10.4 - Prob. 4TYCh. 10.4 - Prob. 5TYCh. 10.4 - Prob. 6TYCh. 10.4 - For any positive integer n, if G is a connected...Ch. 10.4 - Read the tree in Example 10.4.2 from left to right...Ch. 10.4 - Prob. 2ESCh. 10.4 - Prob. 3ESCh. 10.4 - Prob. 4ESCh. 10.4 - Prob. 5ESCh. 10.4 - Prob. 6ESCh. 10.4 - Prob. 7ESCh. 10.4 - In each of 8—21, either draw a graph with the...Ch. 10.4 - In each of 8—21, either draw a graph with the...Ch. 10.4 - In each of 8—21, either draw a graph with the...Ch. 10.4 - In each of 8—21, either draw a graph with the...Ch. 10.4 - In each of 8—21, either draw a graph with the...Ch. 10.4 - In each of 8—21, either draw a graph with the...Ch. 10.4 - Prob. 14ESCh. 10.4 - In each of 8—21, either draw a graph with the...Ch. 10.4 - In each of 8—21, either draw a graph with the...Ch. 10.4 - Prob. 17ESCh. 10.4 - In each of 8—21, either draw a graph with the...Ch. 10.4 - In each of 8—21, either draw a graph with the...Ch. 10.4 - In each of 8—21, either draw a graph with the...Ch. 10.4 - In each of 8—21, either draw a graph with the...Ch. 10.4 - A connected graph has twelve vertices and eleven...Ch. 10.4 - A connected graph has nine vertices and twelve...Ch. 10.4 - Prob. 24ESCh. 10.4 - Prob. 25ESCh. 10.4 - If a graph has n vertices and n2 or fewer can it...Ch. 10.4 - A circuit-free graph has ten vertices and nine...Ch. 10.4 - Is a circuit-free graph with n vertices and at...Ch. 10.4 - Prob. 29ESCh. 10.4 - Prob. 30ESCh. 10.4 - a. Prove that the following is an invariant for...Ch. 10.5 - Prob. 1TYCh. 10.5 - Prob. 2TYCh. 10.5 - Prob. 3TYCh. 10.5 - Prob. 4TYCh. 10.5 - Prob. 5TYCh. 10.5 - Prob. 1ESCh. 10.5 - Prob. 2ESCh. 10.5 - Draw binary trees to represent the following...Ch. 10.5 - Prob. 4ESCh. 10.5 - Prob. 5ESCh. 10.5 - Prob. 6ESCh. 10.5 - Prob. 7ESCh. 10.5 - Prob. 8ESCh. 10.5 - Prob. 9ESCh. 10.5 - Prob. 10ESCh. 10.5 - Prob. 11ESCh. 10.5 - Prob. 12ESCh. 10.5 - Prob. 13ESCh. 10.5 - Prob. 14ESCh. 10.5 - Prob. 15ESCh. 10.5 - Prob. 16ESCh. 10.5 - Prob. 17ESCh. 10.5 - Prob. 18ESCh. 10.5 - Prob. 19ESCh. 10.5 - Prob. 20ESCh. 10.5 - Prob. 21ESCh. 10.5 - Prob. 22ESCh. 10.5 - Prob. 23ESCh. 10.5 - Prob. 24ESCh. 10.5 - In 21-25, use the steps of Algorithm 10.5.1 to...Ch. 10.6 - Prob. 1TYCh. 10.6 - Prob. 2TYCh. 10.6 - Prob. 3TYCh. 10.6 - In Kruskal’s algorithm, the edges of a connected,...Ch. 10.6 - Prob. 5TYCh. 10.6 - Prob. 6TYCh. 10.6 - At each stage of Dijkstra’s algorithm, the vertex...Ch. 10.6 - Prob. 1ESCh. 10.6 - Prob. 2ESCh. 10.6 - Prob. 3ESCh. 10.6 - Prob. 4ESCh. 10.6 - Prob. 5ESCh. 10.6 - Prob. 6ESCh. 10.6 - Prob. 7ESCh. 10.6 - Prob. 8ESCh. 10.6 - Prob. 9ESCh. 10.6 - Prob. 10ESCh. 10.6 - A pipeline is to be built that will link six...Ch. 10.6 - Use Dijkstra’s algorithm for the airline route...Ch. 10.6 - Use Dijkstra’s algorithm to find the shortest path...Ch. 10.6 - Use Dijkstra’s algorithm to find the shortest path...Ch. 10.6 - Use Dijkstra’s algorithm to find the shortest path...Ch. 10.6 - Use Dijkstra’s algorithm to find the shortest path...Ch. 10.6 - Prob. 17ESCh. 10.6 - Prob. 18ESCh. 10.6 - Prob. 19ESCh. 10.6 - Prob. 20ESCh. 10.6 - Prob. 21ESCh. 10.6 - Prob. 22ESCh. 10.6 - Prob. 23ESCh. 10.6 - Prob. 24ESCh. 10.6 - Prob. 25ESCh. 10.6 - Prob. 26ESCh. 10.6 - Prob. 27ESCh. 10.6 - Suppose a disconnected graph is input to Kruskal’s...Ch. 10.6 - Suppose a disconnected graph is input to Prim’s...Ch. 10.6 - Modify Algorithm 10.6.3 so that the output...Ch. 10.6 - Prob. 31ES
Knowledge Booster
Similar questions
- I need some assistance solving Part B of this question. Refer to the excel data in the image provided to answer Part B. SoftBus Company sells PC equipment and customized software to small companies to help them manage their day-to-day business activities. Although SoftBus spends time with all customers to understand their needs, the customers are eventually on their own to use the equipment and software intelligently. To understand its customers better, SoftBus recently sent questionnaires to a large number of prospective customers. Key personnel—those who would be using the software—were asked to fill out the questionnaire. SoftBus received 82 usable responses, as shown in the file. You can assume that these employees represent a random sample of all of SoftBus's prospective customers. SoftBus believes it can afford to spend much less time with customers who own PCs and score at least 4 on PC Knowledge. Let's call these the "PC-savvy" customers. On the other hand, SoftBus believes it…arrow_forward(12 points) Let E={(x, y, z)|x²+ y² + z² ≤ 4, x, y, z > 0}. (a) (4 points) Describe the region E using spherical coordinates, that is, find p, 0, and such that (x, y, z) (psin cos 0, psin sin 0, p cos) € E. (b) (8 points) Calculate the integral E xyz dV using spherical coordinates.arrow_forwardLet us suppose we have some article reported on a study of potential sources of injury to equine veterinarians conducted at a university veterinary hospital. Forces on the hand were measured for several common activities that veterinarians engage in when examining or treating horses. We will consider the forces on the hands for two tasks, lifting and using ultrasound. Assume that both sample sizes are 6, the sample mean force for lifting was 6.2 pounds with standard deviation 1.5 pounds, and the sample mean force for using ultrasound was 6.4 pounds with standard deviation 0.3 pounds. Assume that the standard deviations are known. Suppose that you wanted to detect a true difference in mean force of 0.25 pounds on the hands for these two activities. Under the null hypothesis, 40 0. What level of type II error would you recommend here? = Round your answer to four decimal places (e.g. 98.7654). Use α = 0.05. β = 0.0594 What sample size would be required? Assume the sample sizes are to be…arrow_forward
- (10 points) Let f(x, y, z) = ze²²+y². Let E = {(x, y, z) | x² + y² ≤ 4,2 ≤ z < 3}. Calculate the integral y, f(x, y, z) dV.arrow_forward(14 points) Let f: R3 R and T: R3. →R³ be defined by f(x, y, z) = ln(x²+ y²+2²), T(p, 0,4)=(psin cos 0, psin sin, pcos). (a) (4 points) Write out the composition g(p, 0, 4) = (foT)(p,, ) explicitly. Then calculate the gradient Vg directly, i.e. without using the chain rule. (b) (4 points) Calculate the gradient Vf(x, y, z) where (x, y, z) = T(p, 0,4). (c) (6 points) Calculate the derivative matrix DT(p, 0, p). Then use the Chain Rule to calculate Vg(r,0,4).arrow_forward(10 points) Let S be the upper hemisphere of the unit sphere x² + y²+2² = 1. Let F(x, y, z) = (x, y, z). Calculate the surface integral J F F-dS. Sarrow_forward
- Suppose you are gambling on a roulette wheel. Each time the wheel is spun, the result is one of the outcomes 0, 1, and so on through 36. Of these outcomes, 18 are red, 18 are black, and 1 is green. On each spin you bet $5 that a red outcome will occur and $1 that the green outcome will occur. If red occurs, you win a net $4. (You win $10 from red and nothing from green.) If green occurs, you win a net $24. (You win $30 from green and nothing from red.) If black occurs, you lose everything you bet for a loss of $6. a. Use simulation to generate 1,000 plays from this strategy. Each play should indicate the net amount won or lost. Then, based on these outcomes, calculate a 95% confidence interval for the total net amount won or lost from 1,000 plays of the game. (Round your answers to two decimal places and if your answer is negative value, enter "minus" sign.) Lower Limit Upper Limitarrow_forward(8 points) Calculate the following line integrals. (a) (4 points) F Fds where F(x, y, z) = (x, y, xy) and c(t) = (cost, sint, t), tЄ [0,π] . (b) (4 points) F. Fds where F(x, y, z) = (√xy, e³, xz) where c(t) = (t², t², t), t = [0, 1] .arrow_forwardreview help please and thank you!arrow_forward
- You recieve a case of fresh Michigan cherries that weighs 8.2 kg. You will be making cherry pies. Each pie will require 1 3/4 pounds of pitted cherries. How many pies can be made from the case if the yield percent for cherries is 87arrow_forward(10 points) Let S be the surface that is part of the sphere x² + y²+z² = 4 lying below the plane 2√3 and above the plane z-v -√3. Calculate the surface area of S.arrow_forward(8 points) Let D = {(x, y) | 0 ≤ x² + y² ≤4}. Calculate == (x² + y²)³/2dA by making a change of variables to polar coordinates, i.e. x=rcos 0, y = r sin 0.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Discrete Mathematics and Its Applications ( 8th I...MathISBN:9781259676512Author:Kenneth H RosenPublisher:McGraw-Hill Education
Mathematics for Elementary Teachers with Activiti...MathISBN:9780134392790Author:Beckmann, SybillaPublisher:PEARSON
Thinking Mathematically (7th Edition)MathISBN:9780134683713Author:Robert F. BlitzerPublisher:PEARSON
Discrete Mathematics With ApplicationsMathISBN:9781337694193Author:EPP, Susanna S.Publisher:Cengage Learning,
Pathways To Math Literacy (looseleaf)MathISBN:9781259985607Author:David Sobecki Professor, Brian A. MercerPublisher:McGraw-Hill Education
Discrete Mathematics and Its Applications ( 8th I...
Math
ISBN:9781259676512
Author:Kenneth H Rosen
Publisher:McGraw-Hill Education
Mathematics for Elementary Teachers with Activiti...
Math
ISBN:9780134392790
Author:Beckmann, Sybilla
Publisher:PEARSON
Thinking Mathematically (7th Edition)
Math
ISBN:9780134683713
Author:Robert F. Blitzer
Publisher:PEARSON
Discrete Mathematics With Applications
Math
ISBN:9781337694193
Author:EPP, Susanna S.
Publisher:Cengage Learning,
Pathways To Math Literacy (looseleaf)
Math
ISBN:9781259985607
Author:David Sobecki Professor, Brian A. Mercer
Publisher:McGraw-Hill Education