4. Let G = (V, E) be a directed graph and let S1,, Sm be its strongly connected components. Define a new graph G' = (V', E') as follows. V' = {1, -. ,m}. Place an edge from i to j in G' if there is a vertex u E S; and a vertex vE S; such that (u, v) E E. ... • Show that G' is a DAG. • Let n1, n2, . nm be a topological ordering of vertices in G'. Suppose that there is no edge between n; and ni+1 in G', then show that for every pair of vcrtices u, v, with u E Si and v E Si+1, there is no path from u to v in G. ...

4. Let G = (V, E) be a directed graph and let S1,, Sm be its strongly connected components. Define a new graph G' = (V', E') as follows. V' = {1, -. ,m}. Place an edge from i to j in G' if there is a vertex u E S; and a vertex vE S; such that (u, v) E E. ... • Show that G' is a DAG. • Let n1, n2, . nm be a topological ordering of vertices in G'. Suppose that there is no edge between n; and ni+1 in G', then show that for every pair of vcrtices u, v, with u E Si and v E Si+1, there is no path from u to v in G. ...

Advanced Engineering Mathematics

10th Edition

ISBN:9780470458365

Author:Erwin Kreyszig

Publisher:Erwin Kreyszig

Chapter2: Second-order Linear Odes

Section: Chapter Questions

Problem 1RQ

See similar textbooks

Similar questions

3 and 4
Which transformation would produce an image with vertices A'(3,-1),B'(6,-5),C'(1,-4)
Show that an edge e is a bridge of a graph G if and only if {e} is a bond of G.
5. Let G = (V, E) be a graph with vertex-set V = {1,2,3,4} and edge-set E = {(1, 2), (3, 2), (4, 3), (1, 4), (2,4)}. (a) Draw the graph. Find (b) maximal degree, i.e. A(G), (c) minimal degree, i.e. 8(G), (d) the size of biggest clique, i.e. w(G), (e) the size of biggest independent set, i.e. a(G), ter (f) the minimal number of colours needed to color the graph, i.e. x(G).
7. a) How many different paths of length 2 are there in the undirected graph G in Fig. 11.43? b) Let G = (V, E) be a loop-free undirected graph, where V= {U, v2. ..., v) and deg(v,) = d,, for all I sisn. How many different paths of length 2 are there in G? Figure 11.43
Prove Forward and Reverse: A connected undirected graph has a Eulerian Path iff it has 2 vertices of odd degree
6© Conaider a gaaph with 11 Vertices, which has at what will lbe X(4). 'Color this graph (Show all staps) least one yeleor clique abo. Suppose thire find menimum bipantite metching en that 6 people and 6 tesks are Penson is Tasks TI, T6 asaijned to I4 73, T6 T2, T3, TS T4, Tb E TI, T2, T4 .
b,c,d
a 2 6 oo 6 3 4 3 b i 2 14 f G- Fig-2 4 4 2 C 3 در d al
Please avoid solutions in an image format thanks
Construct a graph with vertices U, V, W, X,Y that has an Euler path, the degree of U is 1 and the degree of Y is 3. What is the edge set?
G.5