A graph is said to be complete if there is an 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 an edge between every pair of vertices.

1. A. true, true

2.false, true

3.false, false

4.true, false

Posted Date:-2022-07-05 22:30:07


More MCQS Questions and answers