Recall that a permutation matrix is a square matrix whose entries are all 0 0 0 or 1, 1, 1, such that each row and each column contains exactly one 1. An adjacency matrix is a matrix that contains rows and columns used to represent a simple labeled graph with the numbers 0 and 1 in the position of (VI, Vj).

Some properties and computations in graph theory can be carried out efficiently and elegantly. n imes n n×n matrix, where each entry represents the number of edges from one vertex to another. Dimana 1 menandakan jika node i menuju node j memiliki edge, dan 0 jika tidak memiliki edge. Adjacency matrix adalah matriks yang hanya terdiri dari 1 dan 0. n n vertices, its adjacency matrix is an. Dalam Matematika dan Computer Science, sebuah adjacency matrix adalah sarana untuk merepresentasikan node-node dari suatu graph yang berdekatan dengan node yang lainnya. Given a graph G G G with n n n vertices, the adjacency matrix is an n × n n imes n n × n matrixĪ = ( a 11 a 12 ⋯ a 1 n a 21 a 22 ⋯ a 2 n ⋮ ⋮ ⋱ ⋮ a n 1 a n 2 ⋯ a n n ) ,Ī = egin. An adjacency matrix is a compact way to represent the structure of a finite graph.