0
A graph in which every pair of distinct vertices is connected by exactly one edge is called a:
- ASparse graph
- BComplete graph
- CBipartite graph
- DDirected graph
Correct answer: B
Discussion 0
Log in or create a free account to reply and vote.
Nobody has replied yet. Start the discussion!