Q110
A graph having an edge from each vertex to every other vertex is called a . . . . . . . .
A.
Tightly Connected
AnswerB.
Strongly Connected
C.
Weakly Connected
D.
Loosely Connected
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board