The answer is > ndjsjdjddh
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:
Step-by-step explanation:
the probability that at least one envelope is a yellow envelope is 16/21
Step-by-step explanation:
The probability that at least one envelope is a yellow envelope is P(Y);
P(Y) = 1 - P(Y)'
P(Y)' is the probability that no envelope is a yellow envelope.
Given;
red envelope = 1
blue envelopes = 3
green envelopes = 2
yellow envelopes = 3
Total = 9
Number of non-yellow envelope = 9 -3 = 6(6 envelope are not yellow)
P(Y)' = P1 × P2 × P3
there is no replacement;
P(Y)' = 6/9 × 5/8 × 4/7
P(Y)' = 5/21
From equation 1;
P(Y) = 1 - 5/21
P(Y) = 16/21
the probability that at least one envelope is a yellow envelope is 16/21.
Answer:
no solutions
Step-by-step explanation:
-4(5k-7) +2k= -2(9k+5)
Distribute
-20k +28 +2k = -18k -10
Combine like terms
-18k +28 = -18k -10
Add 18k to each side
-18k+18k +28 = -18k+18k -10
28 = -10
This is never true so there are no solutions
Answer:


![f(x+8)=\sqrt[3]{(x+8)} -3](https://tex.z-dn.net/?f=f%28x%2B8%29%3D%5Csqrt%5B3%5D%7B%28x%2B8%29%7D%20-3)
----------------------------
Hope it helps..
Have a great day!!