InterviewSolution
 Saved Bookmarks
    				| 1. | 
                                    Let X be the adjacency matrix of a graph G with no self loops. The entries along the principal diagonal of X are(A) all zeros(B) all ones(C) both zeros and ones(D) different | 
                            
| Answer» | |