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.
Answer:
let the angles be 7x , 13x , 16x
7x + 13x + 16x = 180 ( sum of angles in a triangle is 180 degree)
36x = 180
x = 180 / 36
x = 5
therefore the angles are:
7 X 5 = 35 degree
13 X 5 = 65 degree
16 x 5 = 80 degree
plz mark me as the brainliest
(y^2 + 7y +12) / (y^2+8y +15)
factor both equations:
(y+3)(y+4) / (y+3) (y+5)
cancel out common factors to get:
y+4 / y+5
16 because it is even I believe.
