Question

how to find the loop by looking at the adjacency matrix?​

Answer 1

Step-by-step explanation:

The matrix to represent a graph in this way is called Adjacency matrix . The size of adjacency matrix is equal to the number of vertices in the graph. It is a square matrix (that is the number of rows is equal to the number of columns). has one common edge, then element (a, b) = 1 and element (b, a) = 1.

Answer 2

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.

Illustration

■

The adjacency matrix of an undirected graph..

Step-by-step explanation:

Pls mark me brainliest