What is the minimum number of arcs in any strongly connected digraphwith n vertices?What does that digraph look like? Prove your
answer. (b) What is the maximum distance between any two vertices in the digraph of part (a)?
1 answer:
Answer:
Step-by-step explanation:
1] the minimum number of arcs in any strongly connected digraph with n vertices is 'n' . the graph look like a cycle
the graph is in the attached file
in a directed cycle we have strongly connected graph since we can reach any vertax from any vertax, it has minimum arc which is 'n'
since if we use less than n vertax then the given graph has atmost one tree which is not strongly connected graph.
2] the maximum distance between two vertax is 5 which from veratx 1 to vertax 6 distance is 5
1----->2------->3--------->4------->5-------->6
if we use cycle of n node then the maximum distance between two vertax is n-1
You might be interested in
It should be noted that Polygon 3 and polygon 4 are similar to polygon 1.
<h3>What exactly is polygon?</h3>In geometry, it should be noted that a polygon is a plane figure which is described by a finite number of straight line segments that are connected in order to form a closed polygonal chain.
In this case, the bounded plane region, the bounding circuit, may be called a polygon. Also, a similarity transformation is the conformal mapping whose transformation matrix are identical.
In this case, it should be noted that Polygon 3 and polygon 4 are similar to polygon 1.
Learn more about polygon on:
#SPJ1
