 10.2.1: In the graph below, determine whether the following walks are trail...
 10.2.2: In the graph below, determine whether the following walks are trail...
 10.2.3: Let G be the graph v1 v2 e2 e1 and consider the walk v1e1v2e2v1. a....
 10.2.4: Consider the following graph.
 10.2.5: Consider the following graph. e2 e1 e5 e3 e4 a c b a. How many path...
 10.2.6: An edge whose removal disconnects the graph of which it is a part i...
 10.2.7: Given any positive integer n, (a) find a connected graph with n edg...
 10.2.8: Find the number of connected components for each of the following g...
 10.2.9: Each of (a)(c) describes a graph. In each case answer yes, no, or n...
 10.2.10: The solution for Example 10.2.5 shows a graph for which every verte...
 10.2.11: Is it possible for a citizen of Knigsberg to make a tour of the cit...
 10.2.12: Determine which of the graphs in 1217 have Euler circuits. If the g...
 10.2.13: Determine which of the graphs in 1217 have Euler circuits. If the g...
 10.2.14: Determine which of the graphs in 1217 have Euler circuits. If the g...
 10.2.15: Determine which of the graphs in 1217 have Euler circuits. If the g...
 10.2.16: Determine which of the graphs in 1217 have Euler circuits. If the g...
 10.2.17: Determine which of the graphs in 1217 have Euler circuits. If the g...
 10.2.18: Is it possible to take a walk around the city whose map is shown be...
 10.2.19: For each of the graphs in 1921, determine whether there is an Euler...
 10.2.20: For each of the graphs in 1921, determine whether there is an Euler...
 10.2.21: For each of the graphs in 1921, determine whether there is an Euler...
 10.2.22: The following is a floor plan of a house. Is it possible to enter t...
 10.2.23: Find Hamiltonian circuits for each of the graphs in 23 and 25
 10.2.24: Find Hamiltonian circuits for each of the graphs in 23 and 26
 10.2.25: Show that none of the graphs in 2527 has a Hamiltonian circuit.
 10.2.26: Show that none of the graphs in 2527 has a Hamiltonian circuit.
 10.2.27: Show that none of the graphs in 2527 has a Hamiltonian circuit.
 10.2.28: In 2831 find Hamiltonian circuits for those graphs that have them. ...
 10.2.29: In 2831 find Hamiltonian circuits for those graphs that have them. ...
 10.2.30: In 2831 find Hamiltonian circuits for those graphs that have them. ...
 10.2.31: In 2831 find Hamiltonian circuits for those graphs that have them. ...
 10.2.32: Give two examples of graphs that have Euler circuits but not Hamilt...
 10.2.33: Give two examples of graphs that have Hamiltonian circuits but not ...
 10.2.34: Give two examples of graphs that have circuits that are both Euler ...
 10.2.35: Give two examples of graphs that have Euler circuits and Hamiltonia...
 10.2.36: A traveler in Europe wants to visit each of the cities shown on the...
 10.2.37: a. Prove that if a walk in a graph contains a repeated edge, then t...
 10.2.38: Prove Lemma 10.2.1(a): If G is a connected graph, then any two dist...
 10.2.39: Prove Lemma 10.2.1(b): If vertices v and w are part of a circuit in...
 10.2.40: Draw a picture to illustrate Lemma 10.2.1(c): If a graph G is conne...
 10.2.41: Prove that if there is a trail in a graph G from a vertex v to a ve...
 10.2.42: If a graph contains a circuit that starts and ends at a vertex v, d...
 10.2.43: Prove that if there is a circuit in a graph that starts and ends at...
 10.2.44: Let G be a connected graph, and let C be any circuit in G that does...
 10.2.45: Prove that any graph with an Euler circuit is connected.
 10.2.46: Prove Corollary 10.2.5
 10.2.47: For what values of n does the complete graph Kn with n vertices hav...
 10.2.48: For what values of m and n does the complete bipartite graph on (m,...
 10.2.49: What is the maximum number of edges a simple disconnected graph wit...
 10.2.50: Show that a graph is bipartite if, and only if, it does not have a ...
Solutions for Chapter 10.2: Trails, Paths, and Circuits
Full solutions for Discrete Mathematics with Applications  4th Edition
ISBN: 9780495391326
Solutions for Chapter 10.2: Trails, Paths, and Circuits
Get Full SolutionsChapter 10.2: Trails, Paths, and Circuits includes 50 full stepbystep solutions. Since 50 problems in chapter 10.2: Trails, Paths, and Circuits have been answered, more than 56218 students have viewed full stepbystep solutions from this chapter. This expansive textbook survival guide covers the following chapters and their solutions. This textbook survival guide was created for the textbook: Discrete Mathematics with Applications , edition: 4. Discrete Mathematics with Applications was written by and is associated to the ISBN: 9780495391326.

Change of basis matrix M.
The old basis vectors v j are combinations L mij Wi of the new basis vectors. The coordinates of CI VI + ... + cnvn = dl wI + ... + dn Wn are related by d = M c. (For n = 2 set VI = mll WI +m21 W2, V2 = m12WI +m22w2.)

Complex conjugate
z = a  ib for any complex number z = a + ib. Then zz = Iz12.

Cross product u xv in R3:
Vector perpendicular to u and v, length Ilullllvlll sin el = area of parallelogram, u x v = "determinant" of [i j k; UI U2 U3; VI V2 V3].

Determinant IAI = det(A).
Defined by det I = 1, sign reversal for row exchange, and linearity in each row. Then IAI = 0 when A is singular. Also IABI = IAIIBI and

Independent vectors VI, .. " vk.
No combination cl VI + ... + qVk = zero vector unless all ci = O. If the v's are the columns of A, the only solution to Ax = 0 is x = o.

Inverse matrix AI.
Square matrix with AI A = I and AAl = I. No inverse if det A = 0 and rank(A) < n and Ax = 0 for a nonzero vector x. The inverses of AB and AT are B1 AI and (AI)T. Cofactor formula (Al)ij = Cji! detA.

Kirchhoff's Laws.
Current Law: net current (in minus out) is zero at each node. Voltage Law: Potential differences (voltage drops) add to zero around any closed loop.

Linear transformation T.
Each vector V in the input space transforms to T (v) in the output space, and linearity requires T(cv + dw) = c T(v) + d T(w). Examples: Matrix multiplication A v, differentiation and integration in function space.

Multiplicities AM and G M.
The algebraic multiplicity A M of A is the number of times A appears as a root of det(A  AI) = O. The geometric multiplicity GM is the number of independent eigenvectors for A (= dimension of the eigenspace).

Nilpotent matrix N.
Some power of N is the zero matrix, N k = o. The only eigenvalue is A = 0 (repeated n times). Examples: triangular matrices with zero diagonal.

Normal matrix.
If N NT = NT N, then N has orthonormal (complex) eigenvectors.

Plane (or hyperplane) in Rn.
Vectors x with aT x = O. Plane is perpendicular to a =1= O.

Polar decomposition A = Q H.
Orthogonal Q times positive (semi)definite H.

Rank one matrix A = uvT f=. O.
Column and row spaces = lines cu and cv.

Schwarz inequality
Iv·wl < IIvll IIwll.Then IvTAwl2 < (vT Av)(wT Aw) for pos def A.

Spanning set.
Combinations of VI, ... ,Vm fill the space. The columns of A span C (A)!

Toeplitz matrix.
Constant down each diagonal = timeinvariant (shiftinvariant) filter.

Transpose matrix AT.
Entries AL = Ajj. AT is n by In, AT A is square, symmetric, positive semidefinite. The transposes of AB and AI are BT AT and (AT)I.

Triangle inequality II u + v II < II u II + II v II.
For matrix norms II A + B II < II A II + II B II·

Unitary matrix UH = U T = UI.
Orthonormal columns (complex analog of Q).