Question

45.The adjacency of a matrix
depends upon the ordering of its​

Answer 1

Answer:

The adjacency matrix of a simple labeled graph is the matrix A with A[[i,j]] or 0 according to whether the vertex vj, is adjacent to the vertex vj or not. For simple graphs without self-loops, the adjacency matrix has 0 s on the diagonal. For undirected graphs, the adjacency matrix is symmetric.

Answer 2

Answer:

see the pic dear plss mark as brainlist answer