let x be the adjacency matrix of a graph .G with no self loop.The entries along the principle diagonal of x are

M

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Data Structure and Algorithms (DSA)

Q. let x be the adjacency matrix of a graph .G with no self loop.The entries along the principle diagonal of x are

(A) all "0"
(B) all "1"
(C) both 0&1
(D) different

💬 Discuss

✅ Correct Answer: (A) all "0"

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

762

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

84%

Success Rate