• A A graph in which there are no cycles
  • B A graph in which every node has a unique degree
  • C A graph in which every node is connected to at least one other node
  • D A graph in which every node is connected to every other node
  • Share this MCQ
‹ Previous Next ›
Write your comment