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

M

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Data Structure and Algorithms (DSA)

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

(A) true, false, true
(B) true, true, false
(C) true, true, true
(D) false, true, true

💬 Discuss

✅ Correct Answer: (B) true, true, false

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

741

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

94%

Success Rate