Question

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 digraph

I have been asked this question in final exam.

My question is based upon Graphs topic in chapter Graphs of Discrete Mathematics

Answer 1

The correct answer is (d) connection of every node with every other node including itself in a digraph

The best explanation: Every node should be connected to every other node including itself in a digraph is the complete digraph. Now, graphs are connected, strongly connected and disconnected