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.
(x+2) is the answer.
you distribute (x+2)^2 then cancel out 'likes', which leaves you with (x+2)
Well 12 is 3\4 of 16 so honestly it would take the 8 hours working together.
As far as formula if I had to guess it would look like.. 12Amy(Ay)- 16Alicia(Aa) = 4 hours minus 4 from Amy would be 8hours.
in fraction form might make more sense. 3\4 - 4\4 = 1/4 minus that from Amy and she'll finish together with Alicia 4 hours quicker being 8hours.
Answer:
10
Step-by-step explanation:
divide each side by -4
5x-1=-49
5x=50
x=10
Answer:
90miles divided by 18 miles is 5 gallons
