InterviewSolution
Saved Bookmarks
| 1. |
What is a complete digraph?(a) connection of nodes without containing any cycle(b) connecting nodes to make at least three complete cycles(c) start node and end node in a graph are same having a cycle(d) connection of every node with every other node including itself in a digraphI have been asked this question in final exam.My question is based upon Graphs topic in chapter Graphs of Discrete Mathematics |
|
Answer» The correct answer is (d) connection of EVERY node with every other node INCLUDING itself in a digraph |
|