A graph is said to be complete if there is no edge between every pair of vertices.

Data structure - Online Exam Test Papers | Data structure - MCQs[multiple choice questions and answers ] | Data structure - Mock Test Papers | Data structure - Practice Papers | Data structure - Sample Test Papers |

Question:
 A graph is said to be complete if there is no edge between every pair of vertices.

1.true, false, true

2.true, true, false

3.true, true, true

4.false, true, true

Posted Date:-2022-07-05 22:26:00


More MCQS Questions and answers