Answer:
In graph theory and computer science, an adjacency matrix is a square matrix used to represent a finite graph. The elements of the matrix indicate whether pairs of vertices are adjacent or not in the graph.
In the special case of a finite simple graph, the adjacency matrix is a (0,1)-matrix with zeros on its diagonal. If the graph is undirected, the adjacency matrix is symmetric. The relationship between a graph and the eigenvalues and eigenvectors of its adjacency matrix is studied in spectral graph theory.
The adjacency matrix should be distinguished from the incidence matrix for a graph, a different matrix representation whose elements indicate whether vertex–edge pairs are incident or not, and degree matrix which contains information about the degree of each vertex.
3.2 i believe!!! sorry if i’m late
Answer:
Step-by-step explanation:
-60 plus 85 equals 25 so she has 25 dollars in the bank now.
75miles = 2in
600miles= x in
cross multiply
600× 2 = 75 × x
divide both sides by 75
x = 16 in
therefore the length of the highway on the map is 16 in
