Let D be a directed graph. (a) Assume that there exists a vertex vЄ V(D) such that d, (v) = 0. Prove or disprove that D must be a directed acyclic graph. (b) Assume that D is a directed acyclic graph. Prove or disprove that there exists a vertex vЄ V(D) such that d (v) = 0. Now consider the directed network (D, w) given by the following drawing, where each arc e E A(D) is labelled by its weight w(e). V1 4 V3 7 VA Сл 2 5 4 1 V5 3 V2 4 V6 (c) Give a topological ordering of D. (d) Give the strongly connected components of D. (e) Use Morávek's algorithm to find a longest directed v₁-v6-path in (D, w). Show your working and give the path and its length. (f) If w(v3v4) was decreased from 7 to 4, would this affect the length of a longest directed v₁-v6-path in (D, w)? Justify your answer.
Let D be a directed graph. (a) Assume that there exists a vertex vЄ V(D) such that d, (v) = 0. Prove or disprove that D must be a directed acyclic graph. (b) Assume that D is a directed acyclic graph. Prove or disprove that there exists a vertex vЄ V(D) such that d (v) = 0. Now consider the directed network (D, w) given by the following drawing, where each arc e E A(D) is labelled by its weight w(e). V1 4 V3 7 VA Сл 2 5 4 1 V5 3 V2 4 V6 (c) Give a topological ordering of D. (d) Give the strongly connected components of D. (e) Use Morávek's algorithm to find a longest directed v₁-v6-path in (D, w). Show your working and give the path and its length. (f) If w(v3v4) was decreased from 7 to 4, would this affect the length of a longest directed v₁-v6-path in (D, w)? Justify your answer.
Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
Related questions
Question
can you please answer c and d
Transcribed Image Text:Let D be a directed graph.
(a) Assume that there exists a vertex vЄ V(D) such that d, (v) = 0. Prove or
disprove that D must be a directed acyclic graph.
(b) Assume that D is a directed acyclic graph. Prove or disprove that there exists a
vertex vЄ V(D) such that d (v) = 0.
Now consider the directed network (D, w) given by the following drawing, where each
arc e E A(D) is labelled by its weight w(e).
V1
4 V3
7
VA
Сл
2
5
4
1
V5
3
V2 4
V6
(c) Give a topological ordering of D.
(d) Give the strongly connected components of D.
(e) Use Morávek's algorithm to find a longest directed v₁-v6-path in (D, w). Show
your working and give the path and its length.
(f) If w(v3v4) was decreased from 7 to 4, would this affect the length of a longest
directed v₁-v6-path in (D, w)? Justify your answer.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 1 images
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
