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 the following games are not potential (4, 4) (2,3) ( (5, 3) (1,5) )

A: As per bartleby guidelines for more than one questions asked only first should be answered. Please…

Q: Determine the minimum of f,(x, x,) = (x,² - x,)? + (ãy - 1) subject to the constraint x² - X, + 1-=…

A: To find the minimum value of the function f(x,y), subject to the the constraint gx,y=0, apply the…

Q: Consider the simple random graph constructed as follows. There are n > 2 vertices V1, V2, . . . , Vn…

A:

Q: 7 -5- -4 -3- 4

A: We will try to find common region if any.

Q: For a parallel structure of identical components, the system can succeed if at least one of the…

A: Given : The probability of each component fail is 0.22. Let, p=0.22

Q: Prove (Menger) if x, y are vertices of a graph G and xy e E(G), then the minimum size of an x,y-cut…

A: Proof: The proof uses induction on n. The theorem is trivial for n=1. Suppose x and y are separated…

Q: For a parallel structure of identical components, the system can succeed if at least one of the…

A: Given P(one component fails)=0.09

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: 7. Suppose a graph G = (V, E) has n vertices and m edges (i.e., |V| = n and |E| = m). Further…

A:

Q: If Z ~ N(0,1), compute P(Z2 < 3)

A:

Q: Consider a memoryless discrete-time source which emits a sequence of random elements X1, X2,'· • ,…

A:

Q: 1) If the rational preferences of a consumer over bundles of (x₁, x₂) satisfies which of the bundles…

A: Solution of the problem as follows

Q: Use Ore's theorem to prove that any n-vertex graph G for which |E(G)|> (",') +2 is Hamiltonian.

A: answer is in next step

Q: 5. Let (X, B(R), µ) be a Borel measure space. Suppose that {An = ["+1, 4n-1]}, be a family of…

A: Let (X, B(R), µ) be a Borel measure space

Q: Suppose that a Hamiltonian circuit exists for Cay({(1, 0), (0, 1)}:Zm ⨁ Zn) and that this circuit…

A: Given: A Hamiltonian circuit exists for Cay1, 0, 0, 1 : Zm⊕Zn. And this circuit exists from vertex…

Q: Answer the following questions for the poset ([[1]. [2), (4), (1, 2), (1, 4), (2, 4), (3, 4), (1, 3,…

A:

Q: 20. Confirm the following properties of the greatest common divisor: (a) If gcd(a , b) = 1, and…

A: Since you have asked multiple question, we will solve the first question for you. If you want any…

Q: 11. (10 pts) Given a relation R from a set X = {1,..., m} to a set Y = (1,...,n}, we represent R as…

A: The objective of the question is to write an algorithm that determines if a given relation R,…

Q: 5. Prove or disprove: Let l', and I; be two simple graphs; with V(T)| = m, E(T)=p.V(T)| =n, E(T2)| =…

A:

Q: 15. Let m > 1 be an integer and let T be a tree with m edges. Prove that m+1 a(T) >

A: It is given that Let m&gt;1 be an integer and let T be a tree with m edges.

Q: 3.1.2. (-) Determine the minimum size of a maximal matching in the cycle Cn-

A:

Q: 3.1.6. (-) Let T be a tree with n vertices, and let k be the maximum size of an indepen- dent set in…

A: Given, Vertices of the tree, T =n Maximum size of independent set in T = k To find : α't

Q: 47. Let X1, X2, ., Xn be a sample from any population with parameter 0 and T, and T2,n be any two…

A: The smaller the variance of an estimator, the more efficient it is. Among the two estimators if one…

Q: Prove that If a connected planar simple graph has e edges and v vertices with v ≥ 3 and no circuits…

A: A bipartite graph is a simple graph whose vertices can be partitioned into two sets V1​ and V2​ such…

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

A:

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: a) Show that the number of planted plane trees on n vertices, m of which are leaves (that is, have…

A: To show that:a) The number of planted plane trees on  vertices,  of which are leaves (i.e. have zero…

Q: 8. Let X be the simple symmetric random walk on the integers in continuous time, so that Pi,i+1 (h)…

A:

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: The graph of wheel denoted by W, is obtained when an additional vertex is added to cycle Cn, for n >…

A: We need to match each statement (a) - (d) to and a graph (1)-(5) such that the chosen graph…

Q: 71. Show that the number of planted plane trees on 2n vertices, 2m+1 of which have even number of…

A:

Q: (d) Determine the least upper bound of the set 8 = {3-; ....}. E n3 : n = 1, 2,

A:

Q: 5. There are two special types of vertices of interest for digraphs. A vertex that is not an initial…

A:

Q: Buniakovski26 inequality) If neN and a,a2, ... ,an, b,b2,..,bn are real numbers, prove that k%3D1…

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: 5. Let 0<p<1. Consider a branching process with two types of individuals: type A and type B. Each…

A: . types of individuals are considered in the branching process, type A and type B. There are…

Q: It is required to place in order n books B₁, B2, ..., Bn on a library shelf in such a way that…

A:

Q: A symmetric random walk takes place on the integers 0, 1, 2, ..., N with absorbing barriers at 0 and…

A:

Q: 3. Suppose (a,n) is Cauchy and that for all m, k 2 100, Jam - as 0. Does it follow that the…

A:

Q: Question 8 Multiple choice (one answer) Find the solution of (xy + x)dx = o ln(x² + 1) = (x²y² + x²…

A:

Q: From time to time, the UTM Human Resource (UTMHR) department observes various employees for their…

A: Hello! As you have posted more than 3 sub parts, we are answering the first 3 sub-parts.  In case…