The adjacency matrix of the finite graph can be a standard Idea of graph principle.[84] It records which vertices with the graph are linked by an edge. Matrices that contains just two diverse values (1 and 0 which means by way of example "yes" and "no", respectively) are identified as reasonable matrices. The gap (or Price tag) matrix has specifics