The maximum number of possible non-zero values in an adjacency matrix of a…

MP SET 2024

The maximum number of possible non-zero values in an adjacency matrix of a simple graph with nn vertices is :

  1. A.

    nn

  2. B.

    n2n^2

  3. C.

    n(n−1)/2n(n - 1)/2

  4. D.

    n(n+1)/2n(n + 1)/2

Attempted by 16 students.

Sign up free to check your answer

Sign up free

Explore the full course: Uppsc Polytechnic Lecturer 2025 Cs

Loading lesson…