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
There are 365 days in a year, well,unless is a leap-year, but we're assuming 365 days per year, now, "t" is how many years it takes for population to grow to "P" much, however, 1 day in year terms is really just 1/365 year or about 0.003 years, and 2 days is just 2/365 year, and 3 days is 3/365 year and so on, thus,
Answer:
´The variance is 10000
Step-by-step explanation:
The variance is defined as the square of standard deviation, consequently it is as follows:
σ^2=
σ^2=10000
