Answer:
Contradiction
Step-by-step explanation:
Suppose that G has more than one cycle and let C be one of the cycles of G, if we remove one of the edges of C from G, then by our supposition the new graph G' would have a cycle. However, the number of edges of G' is equal to m-1=n-1 and G' has the same vertices of G, which means that n is the number of vertices of G. Therefore, the number of edges of G' is equal to the number of vertices of G' minus 1, which tells us that G' is a tree (it has no cycles), and so we get a contradiction.
Answer:
10(x - 12)
Step-by-step explanation:
10(x - 12)
10x - 120 Distributive Property
Answer
(a) 
(b) 
Step-by-step explanation:
(a)
δ(t)
where δ(t) = unit impulse function
The Laplace transform of function f(t) is given as:

where a = ∞
=> 
where d(t) = δ(t)
=> 
Integrating, we have:
=> 
Inputting the boundary conditions t = a = ∞, t = 0:

(b) 
The Laplace transform of function f(t) is given as:



Integrating, we have:
![F(s) = [\frac{-e^{-(s + 1)t}} {s + 1} - \frac{4e^{-(s + 4)}}{s + 4} - \frac{(3(s + 1)t + 1)e^{-3(s + 1)t})}{9(s + 1)^2}] \left \{ {{a} \atop {0}} \right.](https://tex.z-dn.net/?f=F%28s%29%20%3D%20%5B%5Cfrac%7B-e%5E%7B-%28s%20%2B%201%29t%7D%7D%20%7Bs%20%2B%201%7D%20-%20%5Cfrac%7B4e%5E%7B-%28s%20%2B%204%29%7D%7D%7Bs%20%2B%204%7D%20-%20%5Cfrac%7B%283%28s%20%2B%201%29t%20%2B%201%29e%5E%7B-3%28s%20%2B%201%29t%7D%29%7D%7B9%28s%20%2B%201%29%5E2%7D%5D%20%5Cleft%20%5C%7B%20%7B%7Ba%7D%20%5Catop%20%7B0%7D%7D%20%5Cright.)
Inputting the boundary condition, t = a = ∞, t = 0:
