Let X be the adjacency matrix of a’graph G with no self loops. The entries alongthe principal diagonalof X are

A

all zeros

B

all ones

C

both zeros and ones

D

different