A graph having an edge from each vertex to every other vertex is called a ___________
Posted: Wed Jul 13, 2022 7:44 pm
a) Tightly Connected
b) Strongly Connected
c) Weakly Connected
d) Loosely Connected
b) Strongly Connected
c) Weakly Connected
d) Loosely Connected