MCQs > IT & Programming > Data Structures And Algorithms > If X is the adjacency matrix of a graph G with no self loops, the entries along the principle diagonal of X are ______.

Data Structures And Algorithms MCQs

If X is the adjacency matrix of a graph G with no self loops, the entries along the principle diagonal of X are ______.

Answer

Correct Answer: both zeros and ones

Explanation:

Note: This Question is unanswered, help us to find answer for this one

Data Structures And Algorithms Skill Assessment

Overall Skill Level-Poor

Your Skill Level: Poor

Retake Quizzes to improve it

search

Data Structures And Algorithms Skill Assessment

Overall Skill Level-Poor

Your Skill Level: Poor

Retake Quizzes to improve it