Question: discrete structures Problem 2. (10 points) Let G = (V,E) be a graph for which each vertex is colored either black or white (but not

discrete structures discrete structures Problem 2. (10 points) Let G = (V,E) be a

Problem 2. (10 points) Let G = (V,E) be a graph for which each vertex is colored either black or white (but not both). We say that vertex v is integrated if at least half of its neighbors (those connected by one edge to v) have a different color than v. Furthermore, we say that a coloring of a graph is integrated if every vertex in the graph is integrated. (a) Show that every graph in which every cycle is of even length has an integrated coloring. Consider the following algorithm: pick an uncolored vertex, color it white, color each of its neighbors black and repeat. Why will this procedure terminate in an integrated coloring? (b) Prove that every graph has an integrated coloring. Consider the following algorithm: First, color every vertex white. Next, if there is a vertex that is not integrated, flip its color When this algorithm terminates, it will yield an integrated coloring. Prove that the process always terminates. (Hint: focus on the number of mixed edges - those whose end-points are of different colors.) What logical principle did you use to prove termination? Problem 2. (10 points) Let G = (V,E) be a graph for which each vertex is colored either black or white (but not both). We say that vertex v is integrated if at least half of its neighbors (those connected by one edge to v) have a different color than v. Furthermore, we say that a coloring of a graph is integrated if every vertex in the graph is integrated. (a) Show that every graph in which every cycle is of even length has an integrated coloring. Consider the following algorithm: pick an uncolored vertex, color it white, color each of its neighbors black and repeat. Why will this procedure terminate in an integrated coloring? (b) Prove that every graph has an integrated coloring. Consider the following algorithm: First, color every vertex white. Next, if there is a vertex that is not integrated, flip its color When this algorithm terminates, it will yield an integrated coloring. Prove that the process always terminates. (Hint: focus on the number of mixed edges - those whose end-points are of different colors.) What logical principle did you use to prove termination

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!

Problem 2. (10 points) Let G = (V,E) be a graph for which each vertex is colored either black or white (but not both). We say that vertex v is integrated if at least half of its neighbors (those...

discrete structures Problem 1. (10 points) In this problem you will develop an alternative proof to show that every connected graph in which every vertex has even degree contains an eulerian cycle....

Let G = (V. E) be an undirected graph with all edge weights equal to I. Let d(i, j) denote the length of the shortest path between i and j. Now, suppose we wish to answer queries from the user of the...

T F Consider a communication network of nodes where node v needs to broadeast a single message to all the other nodes efficiently. The message should be sent to the shortest paths tree from v. T F...

Consider the following problem: INPUT: - directed, unweighted graph G (V, E). Note that the graph is unweighted. Moreover, every vertex in the graph is either red or black. You can access the color...

Let i and j be positive integers. (i) Prove that there exist natural numbers a and b such that ai = bj+gcd(i, j). You may use standard results provided that you state them clearly. [4 marks] (ii) Let...

Give the typing rules for Peano natural numbers and their eliminator.(ii) Using the rules given above, define the addition function.] (iii) Let a binary tree be either a leaf Leaf or a node...

(iii) Now express your decision rule instead using only the quantities p(Ck), p(Cj ), p(x|Ck), p(x|Cj ), and relate it to the diagram above. [2 marks] (iv) If the classifier decision rule assigns...

answer all Makeover Inc. believes that at its current stock price of $16.00 the firm is undervalued in the market. Makeover plans to repurchase 2.4 million of its 20 million shares outstanding. The...

Please draw the polar plots for the following systems. Magnitudes and phases at @= 0, 1, 10, 100 and radian/sec must be calculated. (a) L(s)= (e) L(s)= 1 s-10 (s+10) s+1 ; (b) L(s)=s-10; (c) L(s)= ;...

Prepare a context diagram and a Level 0 DFD for each of the following situations. a. Prepare and file a tax return with the tax owed to the Internal Revenue Service. b. A customer pays an invoice...

BE3.5 (LO 2, 3) The following information is provided about Caltex Company: income from operations $430,000, loss on inventory write-downs $12,000, selling expenses $62,000, and interest expense...

Compared with half a century ago, adoption has become _ _ _ _ _ _ _ _ _ common, but it is more open and acceptabl e , so we probably discuss it _ _ _ _ _ _ _ . fill in the blanks more or much less or...

1. Develop a science for every job, which replaces the old rule-ofthumb method.

l. Discuss in one page the strengths and weaknesses of the arguments in terms of the major claims being made as well as the grounds and warrants the authors provide to support those claims.

3. Offer incentives so that workers behave in accordance with the principles of the science that has been developed.