Answer:
24v
Step-by-step explanation:
simply multiply perform the distributive property. so multiply 6 and 4 and you should get 24. after just add in the v.
pls mark brainlest
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.
If the rounding is to the nearest ten, then the greatest one
is 67,404 and the smallest one is 67,395 .
If the rounding is to the nearest hundred, then the greatest one
is 67,449 and the smallest one is 67,950 .
Answer:
see below
Step-by-step explanation:
h(x) = (x − 5)^2 − 7
This is in vertex form
y = a( x-h)^2 + k
where ( h,k) is the vertex and x=h is the axis of symmetry
( 5,-7) is the vertex and x=5 is the axis of symmetry
