Graph theory-Adjacency Matrix Quiz

What does an adjacency matrix represent?

• Vertex-to-vertex connections

• Vertex-to-edge connections

• Edge-to-edge connections

• None of these

What is the size of an adjacency matrix for a graph with n vertices?

• n × m

• n × n

• m × m

• n × (n-1)

In an undirected graph, the adjacency matrix is:

• Always diagonal

• Symmetric

• Skew-symmetric

• None of these

A zero entry in an adjacency matrix means:

• No edge

• Self-loop

• Weighted edge

• Multiple edges

Self-loops appear in which part of the adjacency matrix?

• Upper triangle

• Lower triangle

• Main diagonal

• None

Main diagonal entries of a simple graph's adjacency matrix are:

• Always zero

• Always one

• Can be any number

• Always negative

Which matrix stores vertex-edge relations?

• Adjacency matrix

• Incidence matrix

• Weight matrix

• Degree matrix

For a directed graph, the adjacency matrix is:

• Always symmetric

• Not necessarily symmetric

• Always zero

• Upper triangular

Space complexity of adjacency matrix is:

• O(n)

• O(m)

• O(n²)

• O(n+m)

In a weighted graph, adjacency matrix entries store:

• Degree

• Weight

• Number of vertices

• Number of paths