Problem 2.13 - page 31. Let G be an n-vertex graph such that for any non-adjacent...
8. This question has two parts. (i) Let G be a graph with minimum vertex degree 8(G) > k. Then prove that G has a path of length at least k. (ii) Let G be a graph of order n. If S(G) > nz?, then prove that G is connected.
(5) Use induction to show that Ig(n) <n for all n > 1.
5. Prove that U(2") (n > 3) is not cyclic.
2) Let G ME) be an undirected Graph. A node cover of G is a subset U of the vertex set V such that every edge in E is incident to at least one vertex in U. A minimum node cover MNC) is one with the lowest number of vertices. For example {1,3,5,6is a node cover for the following graph, but 2,3,5} is a min node cover Consider the following Greedy algorithm for this problem: Algorithm NodeCover (V,E) Uempty While...
Prove that is an integer for all n > 0.
Let n ez, n > 0; let do, d1,..., dn, Co,..., En be integers in the range {0, 1, 2, 3,4}. Prove: If 5*dx = 5* ex k=0 k=0 then ek = =dfor k = 0,1,...,n.
6. Let X be a normal random variable with mean u = 10. What is the standard deviation o if it is known that p (IX – 101 <>) =
v
Problem 5 Let Xi, і ї, , n, n-256, be i.i.d. Pois(1)-random variables, and Sn- il Xi. a) Using Chebychev's inequality, estimate the probability that P(Sn > 2E S]).
Use the Principle of Mathematical Induction to prove that (2i+3) = n(n + 4) for all n > 1.
10. You are given a directed graph G(V, E) where every vertex vi E V is associated with a weight wi> 0. The length of a path is the sum of weights of all vertices along this path. Given s,t e V, suggest an O((n+ m) log n) time algorithm for finding the shortest path m s toO As usual, n = IVI and m = IEI.