- A A graph in which every node is connected to every other node
- B A graph in which every edge has a direction associated with it
- C A graph in which every node has at most one outgoing edge
- D A graph in which every edge has no direction associated with it
- Share this MCQ
Answer:
D
Explanation:
A graph in which every edge has no direction associated with it
Related Topic: