Q108
For the given graph(G), which of the following statements is true?
For the given graph(G), which of the following statements is true?
A.
G is a complete graph
B.
G is not a connected graph
C.
The vertex connectivity of the graph is 2
AnswerD.
The edge connectivity of the graph is 1
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board