Discrete Mathematics with Graph Theory (Classic Version) (3rd Edition) (Pearson Modern Classics for Advanced Mathematics Series)
3rd Edition
ISBN: 9780134689555
Author: Edgar Goodaire, Michael Parmenter
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Videos
Textbook Question
Chapter 7.1, Problem 7E
In how many ways can ten boys and four girls sit in a row?
[BB] In how many ways can they sit in a row if the boys are to sit together and the girls are to sit together?
In how many ways can they sit in a row if the girls are to sit together?
In how many ways can they sit in a row if just the girls are to sit together?
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Question 4
Consider the graph G given by the following drawing.
U6
U5
U4
Ա3
Աշ
U1
VA
V5
V6
V3
V₁
V2
(a) Determine whether G is bipartite. Show your working.
(b) For each of the following sets, state whether it is a matching of G. Justify your
answers.
(i) {}
(ii) {u2v2, U3V3, U4V4, U5V5}
(iii) {u1u2, U3u4, V3 V4 V5 V6}
Now consider the graph H given by the following drawing.
x2
x3
x4
x5
X6
x1
Y1
Y2
Y3
Y4
Y5
Y6
(c) Find a maximum matching of H. Show your working.
(d) Use Hall's theorem to show that H does not have a perfect matching.
Question 2
Let (G, w) be the network with V(G) = {a, b, c, d, e, f},
E(G)
=
{ab, ac, ae, af, bc, bd, bf, cd, ce, de, df, ef}, and
w(ab) = 2,
w(ac) = 3,
w(ae) = 2,
w(af) = 2,
w(bc) = 3,
w(bd) = 2
w(bf) = 3,
w(cd) = 2,
w(ce) = 1,
w(de) = 2,
w(df) = 2,
w(ef) = 2
(a) Draw the network.
(b) For each of the following trees, state whether the tree is a minimum spanning tree
of (G, w). Justify your answers.
(i)
a
b
C
a
(iii)
a
b
d
b
(c) Does there exist a minimum spanning tree of (G, w) that contains the edge af?
Justify your answer.
Now consider an arbitrary network (G, w), and let e = E(G).
(d) Give an efficient algorithm to determine whether (G, w) has a unique minimum
spanning tree. Explain briefly why the algorithm is correct and efficient.
Question 3
Consider the directed network (D, c) given by the
following drawing, where each arc e = A(D) is labelled by its capacity c(e) and two
vertices s and t have been identified.
3
7
3
4
5
t
3
3
8
2
(a) Give an s-t-flow of (D, c) that is not a maximum s-t-flow. Justify your answer.
(b) Give an s-t-cut of (D, c) that is not a minimum s-t-cut. Justify your answer.
(c) Use the Ford-Fulkerson algorithm to find a maximum s-t-flow of (D,c). Draw
the residual network after each iteration of the algorithm and give the size of the
maximum flow.
(d) Show that the flow you have found is indeed a maximum s-t-flow.
Chapter 7 Solutions
Discrete Mathematics with Graph Theory (Classic Version) (3rd Edition) (Pearson Modern Classics for Advanced Mathematics Series)
Ch. 7.1 - True/False Questions 5!=120Ch. 7.1 - Prob. 2TFQCh. 7.1 - Prob. 3TFQCh. 7.1 - Prob. 4TFQCh. 7.1 - Prob. 5TFQCh. 7.1 - Prob. 6TFQCh. 7.1 - True/False Questions
7. An r-permutation of n...Ch. 7.1 - Prob. 8TFQCh. 7.1 - Prob. 9TFQCh. 7.1 - True/False Questions There are 4!=24 ways in which...
Ch. 7.1 - The answers to exercises marked [BB] can be found...Ch. 7.1 - The answers to exercises marked [BB] can be found...Ch. 7.1 - The answers to exercises marked [BB] can be found...Ch. 7.1 - The answers to exercises marked [BB] can be found...Ch. 7.1 - The answers to exercises marked [BB] can be found...Ch. 7.1 - The answers to exercises marked [BB] can be found...Ch. 7.1 - In how many ways can ten boys and four girls sit...Ch. 7.1 - Prob. 8ECh. 7.1 - Prob. 9ECh. 7.1 - Prob. 10ECh. 7.1 - The answers to exercises marked [BB] can be found...Ch. 7.1 - [BB] In how many ways can two couples, the...Ch. 7.1 - Repeat Exercise 12, assuming, in each part, that a...Ch. 7.1 - Prob. 14ECh. 7.1 - Prob. 15ECh. 7.1 - Prob. 16ECh. 7.1 - 17. (a) In how many numbers with seven distinct...Ch. 7.1 - Prob. 18ECh. 7.2 - True/False Questions
Ch. 7.2 - Prob. 2TFQCh. 7.2 - Prob. 3TFQCh. 7.2 - Prob. 4TFQCh. 7.2 - Prob. 5TFQCh. 7.2 - Prob. 6TFQCh. 7.2 - Prob. 7TFQCh. 7.2 - Prob. 8TFQCh. 7.2 - Prob. 9TFQCh. 7.2 - Prob. 1ECh. 7.2 - The answers to exercises marked [BB] can be found...Ch. 7.2 - Prob. 3ECh. 7.2 - The answers to exercises marked [BB] can be found...Ch. 7.2 - [BB] In how many ways can Tom, Billie, and Peter...Ch. 7.2 - The answers to exercises marked [BB] can be found...Ch. 7.2 - 7. In a popular lottery known as Lotto 6/49, a...Ch. 7.2 - Prob. 8ECh. 7.2 - The answers to exercises marked [BB] can be found...Ch. 7.2 - The answers to exercises marked [BB] can be found...Ch. 7.2 - Prob. 11ECh. 7.2 - Prob. 12ECh. 7.2 - Prob. 13ECh. 7.2 - Prob. 14ECh. 7.2 - The answers to exercises marked [BB] can be found...Ch. 7.2 - 16. The head of the Department of Mathematical...Ch. 7.2 - The answers to exercises marked [BB] can be found...Ch. 7.2 - Prob. 18ECh. 7.2 - Prob. 19ECh. 7.2 - Prob. 20ECh. 7.2 - Prob. 21ECh. 7.2 - The answers to exercises marked [BB] can be found...Ch. 7.2 - Prob. 23ECh. 7.2 - Prob. 24ECh. 7.2 - Prob. 25ECh. 7.2 - Prob. 26ECh. 7.3 - Prob. 1TFQCh. 7.3 - Prob. 2TFQCh. 7.3 - Prob. 3TFQCh. 7.3 - Prob. 4TFQCh. 7.3 - Prob. 5TFQCh. 7.3 - Prob. 6TFQCh. 7.3 - Prob. 7TFQCh. 7.3 - Prob. 8TFQCh. 7.3 - Prob. 9TFQCh. 7.3 - Prob. 10TFQCh. 7.3 - Prob. 1ECh. 7.3 - Prob. 2ECh. 7.3 - Prob. 3ECh. 7.3 - Prob. 4ECh. 7.3 - [BB] A fair coin is tossed six times. Find the...Ch. 7.3 - Prob. 6ECh. 7.3 - The next two exercises refer to Lotto 6/49, a...Ch. 7.3 - 8. In Lotto 6/49, find the probability of...Ch. 7.3 - 9. [BB] A basket contains five red balls, four...Ch. 7.3 - Prob. 10ECh. 7.3 - [BB] Repeat Exercise 9 assuming the first ball...Ch. 7.3 - 12. Repeat Exercise 10 assuming the two balls are...Ch. 7.3 - Prob. 13ECh. 7.3 - Prob. 14ECh. 7.3 - Prob. 15ECh. 7.3 - Prob. 16ECh. 7.3 - Find the probability that an integer selected at...Ch. 7.3 - Prob. 18ECh. 7.3 - Prob. 19ECh. 7.3 - Prob. 20ECh. 7.3 - Prob. 21ECh. 7.3 - Prob. 22ECh. 7.3 - Prob. 23ECh. 7.3 - Prob. 24ECh. 7.3 - (See Exercise 11 of Section 7.1), find the...Ch. 7.3 - Prob. 26ECh. 7.3 - Prob. 27ECh. 7.3 - Prob. 28ECh. 7.3 - Prob. 29ECh. 7.3 - Prob. 30ECh. 7.3 - Prob. 31ECh. 7.3 - Prob. 32ECh. 7.4 - Prob. 1TFQCh. 7.4 - Prob. 2TFQCh. 7.4 - Prob. 3TFQCh. 7.4 - Prob. 4TFQCh. 7.4 - Prob. 5TFQCh. 7.4 - Prob. 6TFQCh. 7.4 - Prob. 7TFQCh. 7.4 - Prob. 8TFQCh. 7.4 - Prob. 9TFQCh. 7.4 - Prob. 10TFQCh. 7.4 - Prob. 1ECh. 7.4 - 2. If the die in Exercise 1 is tossed twice, find...Ch. 7.4 - Prob. 3ECh. 7.4 - Prob. 4ECh. 7.4 - Prob. 5ECh. 7.4 - Prob. 6ECh. 7.4 - [BB] A coin has P(H)=14. If it is tossed six times...Ch. 7.4 - The answers to exercises marked [BB] can be found...Ch. 7.4 - Prob. 9ECh. 7.4 - Prob. 10ECh. 7.4 - Prob. 11ECh. 7.4 - Prob. 12ECh. 7.4 - Prob. 13ECh. 7.4 - Prob. 14ECh. 7.4 - 15. A fair coin is tossed n times. Let A be the...Ch. 7.4 - Prob. 16ECh. 7.4 - Prob. 17ECh. 7.4 - Prob. 18ECh. 7.4 - Prob. 19ECh. 7.4 - Prob. 20ECh. 7.4 - Prob. 21ECh. 7.4 - 22. (a) Find the probability that everyone in a...Ch. 7.4 - Prob. 23ECh. 7.4 - Prob. 24ECh. 7.4 - [BB] Given 70P20=.3,40P50=.5, and 10P40=.9, find...Ch. 7.4 - [BB] The probability that two persons aged 20 and...Ch. 7.4 - Prob. 27ECh. 7.4 - Prob. 28ECh. 7.4 - 29. [BB] Consumers in the town of Trout River have...Ch. 7.4 - Prob. 30ECh. 7.4 - 31. A new three- screen cinema has just opened in...Ch. 7.5 - Prob. 1TFQCh. 7.5 - (Answers can be found in the back of the book.)
2....Ch. 7.5 - (Answers can be found in the back of the book.)...Ch. 7.5 - Prob. 4TFQCh. 7.5 - Prob. 5TFQCh. 7.5 - Prob. 6TFQCh. 7.5 - Prob. 7TFQCh. 7.5 - Prob. 8TFQCh. 7.5 - Prob. 9TFQCh. 7.5 - Prob. 10TFQCh. 7.5 - The answers to exercises marked [BB] can be found...Ch. 7.5 - Prob. 2ECh. 7.5 - Prob. 3ECh. 7.5 - Prob. 4ECh. 7.5 - Prob. 5ECh. 7.5 - 6. Twenty varieties of chocolates are available...Ch. 7.5 - Prob. 7ECh. 7.5 - The answers to exercises marked [BB] can be found...Ch. 7.5 - The answers to exercises marked [BB] can be found...Ch. 7.5 - Prob. 10ECh. 7.5 - 11. (a) [BB] In how many ways can ten red balls,...Ch. 7.5 - The answers to exercises marked [BB] can be found...Ch. 7.5 - Prob. 13ECh. 7.5 - Find the number of arrangements of the letters of...Ch. 7.5 - Prob. 15ECh. 7.5 - Prob. 16ECh. 7.5 - Show that there is a one-to-one correspondence...Ch. 7.5 - The answers to exercises marked [BB] can be found...Ch. 7.5 - Prob. 19ECh. 7.6 - (Answers can be found in the back of the book.)
1....Ch. 7.6 - Prob. 2TFQCh. 7.6 - Prob. 3TFQCh. 7.6 - Prob. 4TFQCh. 7.6 - Prob. 5TFQCh. 7.6 - Prob. 6TFQCh. 7.6 - (Answers can be found in the back of the book.)
7....Ch. 7.6 - Prob. 8TFQCh. 7.6 - Prob. 9TFQCh. 7.6 - Prob. 10TFQCh. 7.6 - Prob. 1ECh. 7.6 - Prob. 2ECh. 7.6 - Prob. 3ECh. 7.6 - Prob. 4ECh. 7.6 - Prob. 5ECh. 7.6 - Prob. 6ECh. 7.6 - [BB] In how many ways can the integers 1 through 9...Ch. 7.6 - Without any calculation, prove that...Ch. 7.6 - Prob. 9ECh. 7.6 - Prob. 10ECh. 7.6 - Prob. 11ECh. 7.6 - Prob. 12ECh. 7.7 - (Answers can be found in the back of the book.)
1....Ch. 7.7 - Prob. 2TFQCh. 7.7 - Prob. 3TFQCh. 7.7 - Prob. 4TFQCh. 7.7 - Prob. 5TFQCh. 7.7 - Prob. 6TFQCh. 7.7 - Prob. 7TFQCh. 7.7 - Prob. 8TFQCh. 7.7 - Prob. 9TFQCh. 7.7 - Prob. 10TFQCh. 7.7 - Prob. 1ECh. 7.7 - The answers to exercises marked [BB] can be found...Ch. 7.7 - Prob. 3ECh. 7.7 - Prob. 4ECh. 7.7 - Prob. 5ECh. 7.7 - Prob. 6ECh. 7.7 - Prob. 7ECh. 7.7 - Prob. 8ECh. 7.7 - Prob. 9ECh. 7.7 - Prob. 10ECh. 7.7 - Prob. 11ECh. 7.7 - Prob. 12ECh. 7.7 - Prob. 13ECh. 7.7 - Sequences of integers, {xn},{yn},n0, are defined...Ch. 7.7 - Prob. 15ECh. 7.7 - The answers to exercises marked [BB] can be found...Ch. 7.7 - Prob. 17ECh. 7.7 - 18. Prove the Binominal Theorem by mathematical...Ch. 7.7 - Prob. 19ECh. 7.7 - Prob. 20ECh. 7.7 - Prob. 21ECh. 7.7 - Prob. 22ECh. 7.7 - Prob. 23ECh. 7.7 - 24. There are n books in a line on a shelf and...Ch. 7.7 - Prob. 25ECh. 7 - Prove that 2nP(2n,n) for all integers n1.Ch. 7 - In how many ways can seven boys and six girls...Ch. 7 - Do Exercise 2 again with circle instead of row.Ch. 7 - How many permutations of the letters a, b, c, d,...Ch. 7 - 5. (a) In how many permutations of the 26...Ch. 7 - 6. Find an expression for the number of five-card...Ch. 7 - A committee of seven is to be chosen from eight...Ch. 7 - In how many ways can 12 people from four groups of...Ch. 7 - A car manufacturer is forced to admit that the...Ch. 7 - 10. Ten students find themselves in an...Ch. 7 - 11. For Christmas, Gail wants to buy each of her...Ch. 7 - 12. A Middle East peace conference will be...Ch. 7 - Prob. 13RECh. 7 - Frank wants to buy 12 muffins and finds seven...Ch. 7 - Twelve ships enter the St. Johns harbor one after...Ch. 7 - 16. A candy merchant carries bubble gum balls in...Ch. 7 - 17. In how many ways can the letters of the word...Ch. 7 - 18. In how many ways can five rings be put onto...Ch. 7 - Find the coefficient of x6 in (16x212x)12....Ch. 7 - Find the coefficient of x6 in (16x212x)12....Ch. 7 - 21. Prove that for any .
Ch. 7 - Give a verbal argument for the truth of the...Ch. 7 - 23. Find a simple expression for .
Ch. 7 - Show that (2nn) is even for all n1.Ch. 7 - On the day before midterm break, 20 of the 32...Ch. 7 - 26. A fair coin is tossed n times. Prove that...
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.Similar questions
- Question 1 i Let G be the graph given by the following drawing. g a d b (a) Draw the induced subgraph of G on vertex set {a, d, e, f, g, h}. [4] (b) Draw a subgraph of G that is isomorphic to the graph H with V (H) = {r, s, t, u, v, w, x, y, z} and E(H) = {rs, rt, ru, st, sv, tw, ux, vy, wz}. (c) Draw a spanning tree of G whose set of leaves is {a, b, g, j}, or explain why such a spanning tree does not exist. [4] [4] Call a cycle of a graph H a Hamiltonian cycle of H if it contains every vertex of H. (d) Give a Hamiltonian cycle of G, or explain why such a cycle does not exist. Let G be an arbitrary simple graph, n = = |V(G)|, and m = |E(G)|. [4] (e) Assume that the complement of G is connected. Show that m ≤ ½n² − ³n +1. [8]arrow_forwarduse power series to solve the differential equation y''-y'-y=0arrow_forwarduse power series to solve the differential equation y''-y'-y=0arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
College Algebra (MindTap Course List)AlgebraISBN:9781305652231Author:R. David Gustafson, Jeff HughesPublisher:Cengage Learning
Algebra and Trigonometry (MindTap Course List)AlgebraISBN:9781305071742Author:James Stewart, Lothar Redlin, Saleem WatsonPublisher:Cengage Learning
Algebra & Trigonometry with Analytic GeometryAlgebraISBN:9781133382119Author:SwokowskiPublisher:Cengage
Holt Mcdougal Larson Pre-algebra: Student Edition...AlgebraISBN:9780547587776Author:HOLT MCDOUGALPublisher:HOLT MCDOUGAL
College Algebra (MindTap Course List)
Algebra
ISBN:9781305652231
Author:R. David Gustafson, Jeff Hughes
Publisher:Cengage Learning
Algebra and Trigonometry (MindTap Course List)
Algebra
ISBN:9781305071742
Author:James Stewart, Lothar Redlin, Saleem Watson
Publisher:Cengage Learning
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:9781133382119
Author:Swokowski
Publisher:Cengage
Holt Mcdougal Larson Pre-algebra: Student Edition...
Algebra
ISBN:9780547587776
Author:HOLT MCDOUGAL
Publisher:HOLT MCDOUGAL
Find number of persons in a part with 66 handshakes Combinations; Author: Anil Kumar;https://www.youtube.com/watch?v=33TgLi-wp3E;License: Standard YouTube License, CC-BY
Discrete Math 6.3.1 Permutations and Combinations; Author: Kimberly Brehm;https://www.youtube.com/watch?v=J1m9sB5XZQc;License: Standard YouTube License, CC-BY
How to use permutations and combinations; Author: Mario's Math Tutoring;https://www.youtube.com/watch?v=NEGxh_D7yKU;License: Standard YouTube License, CC-BY
Permutations and Combinations | Counting | Don't Memorise; Author: Don't Memorise;https://www.youtube.com/watch?v=0NAASclUm4k;License: Standard Youtube License
Permutations and Combinations Tutorial; Author: The Organic Chemistry Tutor;https://www.youtube.com/watch?v=XJnIdRXUi7A;License: Standard YouTube License, CC-BY