[Solved]Let G Directed Graph Vertex Decomposition Graphs Collection U1 Uu2 Sets V Uu Un Uj J Ha Q37145598

Let G be a directed graph. A vertex decomposition of a graphs is a collection U1 UU2 . . . of sets, so that V-UU, and Un Uj = ø for iメj. A Hamilton decomposition is a decomposition so that G(U) has an Hamiltonian path for every i. 1. Show that such a decomposition exists if an only if we can select a subset of the edges so that the indegree of every vertex and the outdegree of every vertex is 1. (You have to prove two things here) 2. Give an algorithm that checks if such a decomposition exists. (Hint: You have to double the vertices to get a bipartite graph (V, V, E’) with E’ like E. Choose the appropriate capacities Show transcribed image text Let G be a directed graph. A vertex decomposition of a graphs is a collection U1 UU2 . . . of sets, so that V-UU, and Un Uj = ø for iメj. A Hamilton decomposition is a decomposition so that G(U) has an Hamiltonian path for every i. 1. Show that such a decomposition exists if an only if we can select a subset of the edges so that the indegree of every vertex and the outdegree of every vertex is 1. (You have to prove two things here) 2. Give an algorithm that checks if such a decomposition exists. (Hint: You have to double the vertices to get a bipartite graph (V, V, E’) with E’ like E. Choose the appropriate capacities

Expert Answer

---

Answer to Let G be a directed graph. A vertex decomposition of a graphs is a collection U1 UU2 . . . of sets, so that V-UU, and Un… . . .