by dr. sarah-marie belcastro
|GeoGebra files||Mathematica Demonstration||Mathematical Links||Less Mathematical Links||Errata|
3.5 Graphs: Definitions and Examples
Fig. 3.8 bipartite graph
Fig. 3.11 graphs
Fig. 3.12 graphs
3.8 Try This! More Graph Problems
Fig. 3.21 graphs
Fig. 3.22 graphs
Fig. 3.23 graphs
Fig. 3.24 graphs
Bonus Graph Isomorphism exercises available only here on the web!
11.2 Try This! Planarity Explorations
Fig. 11.1 left graph
Fig, 11.1 right graph
Mathematica Demonstration: (for Chapter 9) Cutting Space into Regions with Four Planes
Mathematical links mentioned in the text:
Chapter 2 (Sets and Logic)
Chapter 3 (Graphs and Functions)
Chapter 4 (Induction)
Chapter 5 (Algorithms with Ciphers)
Chapter 6 (Binomial Coefficients and Pascal's Triangle)
Chapter 8 (Recurrence)
Chapter 9 (Counting and Geometry)
Chapter 10 (Trees)
Chapter 11 (Euler’s Formula)
Chapter 12 (Traversals)
Chapter 13 (Coloring)
Backmatter and References
Less- and Non-mathematical links:
Errata (not all errors are in all printings, but there is no way to tell which printing your copy is...):
page 29, the sentence after Example 2.2.8 should read "...in
these cases, we interpret B \ A to mean B
\ (elements of A in B) = B \ (A (intersect)
page 74, Section 3.6 Check-Yourself problem 2 should have "(See
below for definition of subgraph.)" appended.
page 88, the caption for Figure 3.27 should read "Two possibly
isomorphic infinite graphs."
page 136, second box, the last three numbers in the last line should be 8 18 1.
page 200, Example 7.4.8, PARALLELOGRAM should have 13!/(3!2!3!) anagrams.
page 217, problem 15, the course Physics-with-Calculus II should
just be Physics II.
page 235, the second line after Definition 8.8.2 should read
gives 0+n2-5 not equal to 0 and..."
page 237, step 10 should read an = (1/6)3n + (1/2)(-1)n .
page 284, Figure 10.3, the rightmost edge should have weight 22.
page 289, at the end of the proof that Prim's algorithm works,
there are two references to ek.
Both should simply be references to e.
page 298, Try This! problem 2 should read "Create a binary
decision tree for a robot to use so it can determine which of the
current U.S. coins (penny, nickel, dime, quarter, half-dollar, and
dollar) you have just offered it. The robot can use its sensors
but cannot directly recognize the coins."
page 353, proof of Theorem 12.4.2, the Hamilton path should be P = vb-...-vn-v1-v2-...-va and the parenthetical remark in the following paragraph should read: (Va lists the subscripts for the vertices adjacent to va, and Vb lists the subscripts for the vertices following those adjacent to vb.) Notice that neither Vanor Vbcontains va because va is not adjacent to itself and no vertex follows va in the path (and even using the labeling order, vb is not adjacent to itself).page 389, problem 18 should read "Suppose G has a Hamilton circuit H. How many colors are required to vertex-color H?"
page 416, Theorem 14.7.3 only holds for graphs with at least 4
page 487, answer to Section 1.4 Check-Yourself problem 2: The
tail end of the solution should read "... = 4k2+4k+1+10k+5-3
= 2(2k2+2k+5k+3) -3 = 2(2k2+2k+5k+1)
+1 = (odd)."
page 491, answer to Section 3.2 Check-Yourself problem 2(c) and 2(d): The tail end of the solution should read "...f(a) = f(b)."
page 493, answer to Section 3.6 Check-Yourself problem 2: the list should include P4.
page 500, answer to Section 6.7 Check-Yourself problem 2: 43 should be (-4)3 so that the answer is -1,280.
page 514, answer to Section 14.3 Check-Yourself problem 1: When using the Lemma, we have only one state (seeing all four ducks) so E[W] = 4x1=4 white ducks and E[WH] = 1x1 = 1 white duck.
page 515, answer to Section 14.3 Check-Yourself problem 2(b): The black duck appears in 8 of the subsets, so E[B] = 1/2.