+1 vote
in Data Structures & Algorithms I by (88.2k points)
A graph having an edge from each vertex to every other vertex is called a ___________

(a) Tightly Connected

(b) Strongly Connected

(c) Weakly Connected

(d) Loosely Connected

The query is from Directed Graph in division Graph of Data Structures & Algorithms I

The question was posed to me in an interview.

1 Answer

+1 vote
by (737k points)
selected by
Best answer
Right answer is (a) Tightly Connected

Explanation: This is a part of the nomenclature followed in Graph Theory.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.