If every node u in G is adjacent to every other node v in G, A graph is said to be _______.

M

Mr. Dubey

🎓 Coach ⭐ 104.48K Points

📊 Data Structure (DS)

Q. If every node u in G is adjacent to every other node v in G, A graph is said to be _______.

(A) isolate.
(B) complete.
(C) finite.
(D) Strongly connected.

💬 Discuss

✅ Correct Answer: (B) complete.

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

126

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

87%

Success Rate