Question: (a) Let G = (V, E) be a directed graph or multigraph with no isolated vertices. Prove that G has a directed Euler circuit if
(b) A directed graph is called strongly connected if there is a directed path from a to b for all vertices a, b, where a ≠ b. Prove that if a directed graph has a directed Euler circuit, then it is strongly connected. Is the converse true?
Step by Step Solution
3.30 Rating (165 Votes )
There are 3 Steps involved in it
a If G V E has a directed Euler circuit then for all x y V there is a directed trail from x to y that part of the directed Euler circuit from x to y T... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
954-M-L-A-L-S (8138).docx
120 KBs Word File
