Consider a directed graph on 6 vertices.
a) How many edges does it need to be connected?
b) Is it enough?
- Strong or weakly connected? Are double sided edges counted as one or two? In general, the question on the matcode. - VladD
|
1 answer
There is clearly something missing in the question, namely, what kind of connectivity is needed?
As for the minimum number of edges, then 5
PS It seems to me that it is better to set similar tasks on a hashkod mathematical forum.
Stas0n stas0n
1,585 2 gold marks 18 silver marks 44 bronze marks
|