By a result of Landau (1953), we know that every tournament has a king (a vertex from which every vertex is reachable by a path of length at most 2). Let T be a tournament such that δ-(T) ≥ 1, that is, d-(v) ≥ 1 for all v ∈ V (T). 1. Show that if x is a king in T, then T has another king in N-(x). 2. Using the answer to the previous question, prove that T has at least 3 kings. 3. For each n ≥ 3, give a construction of a tournament T' with n vertices such that δ-(T') ≥ 1 and T' has exactly 3 kings.

Q: Show that a graph with n vertices is bipartite if, and only if, for some labeling of its vertices,…

A: Solution:

Q: How large can a subset C = Z2 be, if d(u, v) ≥2 for all u ‡ v in C? Describe geometrically all the…

A:

Q: (Exercise 2.11.8) Is the set {I, A, A²} linearly dependent or independent in (R²×², R), 1 1 02 ?…

A: 2.  We have to check whether the set  {I,A,A2}  is linearly dependent or independent in (ℝ2×2,ℝ),…

Q: Given that f(x) contains the discrete points of {(0, 3), (1, 4), (2, 0), (3, 1), (4, 2)}, the value…

A: It is given that, function f(x) contains the discrete points of 0,3,1,4,2,0,3,1,4,2. We have to find…

Q: 4. Show that for events A₁, A2, A3, . . . , An P(U=1A;) < min 1<kSn η P(A;) - Σ P(A; ΠΑΚ) j:j#k

A:

Q: Inlsec(x), -플Sxs. Let A be a fuzzy set in R with Hx) = 3 Then 0, otherwise Select one: a. height(A)…

A: Set A is given to be a Fuzzy Set in R with μA(x)=ln(sec(x)),-π3≤x≤π40,otherwise We've to find height…

Q: Let G=(o, μ) with o* = {u, v, w, x}, o(s) = 1 for all s E σ*, μ(uv) = 0.8 = µ(vw), µ(uw) = 0.6,…

A: In this problem, we were given a graph G = (σ, µ) with a set of nodes σ and a set of edges µ. The…

Q: Consider repeated rolling of a fair die, and assume that the different rolls are independent. For i…

A: Given information: Rolling a fair die and different rolls are independent.

Q: Prove that every graph G with n vertices and chromatic number k = x(G) has at most · (n2 – ) edges.…

A:

Q: Two particles A and B move randomly, at times t = 1,2,... on the set M = {1,...,m}, m≥ 3, reflecting…

A:

Q: #3) Estimaser Assume you've run the phase estimation algorithm several times and gotten the results:

A:

Q: 2yy" = 1 + (y')² 2

A:

Q: Suppose that (Xn) is a sequence of random variables on Rd and (d) suppose Xn →Xo. Suppose further…

A: From the given information, Xn0∞ is a sequence of random variables. Suppose Xn→n→∞dX0 Here, X0 is a…

Q: (a) Compute P({a}). (b) Compute P({b}). (c) Compute P({a,b}).

A:

Q: kpression for "12 times x."

A: Times means multiplication. Sometimes it is denoted by dot.

Q: IF X and Y and So is XXY Path- connected, thun

A:

Q: . Let F be a forest with n vertices and k connected components, with 1 deg(v) in terms of n and k.…

A:

Q: If S {1,...,n), for n ≥ 3, and A consists of all k-subsets of S, for n > k≥ 2, then (S, A) is a -…

A:

Q: Is the state (10)|+) +|1)|–)) entangled?

A:

Q: Prove that the Cayley digraph given in Example 6 does not have aHamiltonian circuit. Does it have a…

A:

Q: Theorem 1.4.1 Let n(A) denote the number of elements in set 4 n(A, × A2 × ...× Aµ) = n(A) n(A2).…

A:

Q: The condensation of a graph G with k strong coherence components G1 =. (V1 , E1 ), . . . , Gk = (Vk…

A: As per the question we are given the definition of the condensation of a graph G using which we have…

Q: Use a K-map to minimize this Boolean sum-of-products function in the variables z. Write the…

A:

Q: 14) Find the Jacobian of the tra nsformation. x=5u-v,y=Du+3v

A:

Q: Let V = Mnxn(F). (a) Suppose that {M1,..., Mt} C Mnxn(F) is a spanning set. Prove that {M{,.…, M£}…

A:

Q: If the ratio of boys to girls in tennis camp is 3:5 if there are 64 campers, how many are girls 

A: We find out how many girls as follows:  • We first need to determine the total number of parts in…

Q: (d) Define T: P₂ (R) → R by T(f(x)) = f(2). Compute [T]. (e) If A -(6-3) 0 4 compute [A]a. (f) If…

A:

Q: customers in line at the superexpress checkout at the same time. Suppose the joint pmf of X₁ and X₂…

A:

Q: 4. Let Y + 0 and let A be a collection of subsets of Y satisfying the following two properties: (a)…

A:

Q: Let D be an n-vertex digraph with no cycles. Prove that V (D) can be ordered as v1, . . . , vn such…

A:

Q: Consider the Bayesian network in the figure below. Suppose Wis instantiated (i.e, given) for w.…

A:

Q: Consider the following growing network model in which each node i is assigned an attractiveness a,…

A: I can help you understand the mean-field solution of the growing network model.*Model…

Q: Prove that there is an (v, k, X)-design with b blocks and each element appearing in r blocks if and…

A: The problem at hand deals with the concept of designs and aims to establish a relationship between…

Q: Consider the following growing network model in which each node i is assigned an attractiveness a €…

A: This Is The Expression For The Expected Degree ki(t) of a node in the mean-field…

Q: Let M, be the matrix representation of some relation R on set A. Suppose that set A has n distinct…

A: The relation is between A to A and A has n distinct elements, It is also given that the relation R…

Q: Q.4) The Wronskian W(e-x, e*, e2x), is: a) 6e% Q.5) The general solution of the equation yto + 9y" =…

A:

Q: 2.5) Find the set of all sclutions in x of the following inhomogon cous linear systems Ax=b where A…

A:

Q: Prove that a complete bipartile graph Ks,s has (s−1)!s!/2 Hamiltonian walks for s &gt;1

A:

Q: What will be the sum of all numbers in the neighborhood matrix of graph G? For n∈N we define the set…

A:

Q: (3) Recall that a lattice path on the grid from (0,0) to (n, n) can be viewed as a sequence of…

A: Given: To show that Cn,  is equal to the number of ways of placing n unlabelled ball in n labeled…

Q: 3. Let's generalize the preceding setup a little. Suppose Bob is given a state from m linearly…

A: Denote by |ϕi⟩ the vector orthogonal to the subspace spanned by {|ψj⟩}j≠i and define…

Q: (Chapter 3.2. Ex.# 49) Show that if f₁(x) is (g(x)), f2(x) is (92(x)), and f₂(x) = 0 and 92(x) 0 for…

A: Given: f1x is Θg1x, f2x is Θg2x, and f2x≠0 and g2x≠0 for all real numbers x&gt;0.   To show: f1/f2x…

Q: Prove that simple random walk on a finite, connected, and undirected graph is aperiodic if and only…

A: Given that: G=V,E is bipartite if V=V1⊔V2 with E⊆x,y:x∈V1, y∈V2. Equivalently, G is bipartite if it…

Q: If MC Z is a subset closed under addition and subtraction, then =dZ for some d € Z satisfying d≥ 0.…

A: