Multiple choice:Which of the following is true about the adjacency matrix of a graph?
Which of the following is true about the adjacency matrix of a graph@[ B](1)
A. The adjacency matrix of a digraph is always asymmetric
B. The adjacency matrix of digraph can be symmetric or asymmetric
C. The adjacency matrix of an undirected graph is always asymmetric
D. The adjacency matrix of an undirected graph can be asymmetric or symmetric
A. The adjacency matrix of a digraph is always asymmetric
B. The adjacency matrix of digraph can be symmetric or asymmetric
C. The adjacency matrix of an undirected graph is always asymmetric
D. The adjacency matrix of an undirected graph can be asymmetric or symmetric
answer:B
A. The adjacency matrix of a digraph is always asymmetric
B. The adjacency matrix of digraph can be symmetric or asymmetric
C. The adjacency matrix of an undirected graph is always asymmetric
D. The adjacency matrix of an undirected graph can be asymmetric or symmetric
A. The adjacency matrix of a digraph is always asymmetric
B. The adjacency matrix of digraph can be symmetric or asymmetric
C. The adjacency matrix of an undirected graph is always asymmetric
D. The adjacency matrix of an undirected graph can be asymmetric or symmetric
answer:B