• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

GATE | CS 2022 | Question 52

Which of the properties hold for the adjacency matrix A of a simple undirected unweighted graph having n vertices? 

(A)

The diagonal entries of A2 are the degrees of the vertices of the graph. 

(B)

If the graph is connected, then none of the entries of An-1 + In can be zero.

(C)

If the sum of all the elements of A is at most 2(n-1), then the graph must be acyclic.

(D)

If there is at least a 1 in each of A’s rows and columns, then the graph must be connected. 

Answer

Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated :
Share your thoughts in the comments