Repeat the last part of Problem 58 for the matrix M = 3 − 1 − 1 3 . Note in Section 6 [see (6.15)) that, for the given matrix A, we found A 2 = − I, so it was easy to find all the powers of A. It is not usually this easy to find high powers of a matrix directly. Try it for the square matrix M in equation 11.1 . Then use the method outlined in Problem 57 to find M 4 , M 10 , e M .
Repeat the last part of Problem 58 for the matrix M = 3 − 1 − 1 3 . Note in Section 6 [see (6.15)) that, for the given matrix A, we found A 2 = − I, so it was easy to find all the powers of A. It is not usually this easy to find high powers of a matrix directly. Try it for the square matrix M in equation 11.1 . Then use the method outlined in Problem 57 to find M 4 , M 10 , e M .
Repeat the last part of Problem 58 for the matrix
M
=
3
−
1
−
1
3
.
Note in Section 6 [see (6.15)) that, for the given matrix A, we found
A
2
=
−
I,
so it was easy to find all the powers of A. It is not usually this easy to find high powers of a matrix directly. Try it for the square matrix M in equation
11.1
.
Then use the method outlined in Problem 57 to find
M
4
,
M
10
,
e
M
.
Give an example of a graph with at least 3 vertices that has exactly 2 automorphisms(one of which is necessarily the identity automorphism). Prove that your example iscorrect.
3. [10 marks]
Let Go (Vo, Eo) and G₁
=
(V1, E1) be two graphs that
⚫ have at least 2 vertices each,
⚫are disjoint (i.e., Von V₁ = 0),
⚫ and are both Eulerian.
Consider connecting Go and G₁ by adding a set of new edges F, where each new edge
has one end in Vo and the other end in V₁.
(a) Is it possible to add a set of edges F of the form (x, y) with x € Vo and y = V₁ so
that the resulting graph (VUV₁, Eo UE₁ UF) is Eulerian?
(b) If so, what is the size of the smallest possible F?
Prove that your answers are correct.
Let T be a tree. Prove that if T has a vertex of degree k, then T has at least k leaves.
Calculus for Business, Economics, Life Sciences, and Social Sciences (14th Edition)
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.