$6$ . Find the degree of each vertex in the graph. $\newline$ \begin{tabular}{|l|l|l|l|l|l|l|} $\newline$ \hline Vertex & A & B & C & D & E & F \\ $\newline$ \hline Degree of Vertex & & & & & & \\ $\newline$ \hline $\newline$ \end{tabular}

View step-by-step help

Home

Math Problems

Algebra 2

Write a quadratic function from its vertex and another point

Full solution

6

. Find the degree of each vertex in the graph.

\newline

\begin{tabular}{|l|l|l|l|l|l|l|}

\newline

\hline Vertex & A & B & C & D & E & F \\

\newline

\hline Degree of Vertex & & & & & & \\

\newline

\hline

\newline

\end{tabular}

Find Vertex Degree: To find the degree of a vertex, count the number of edges that connect to it.
Count Edges for $A$ : Count the edges for vertex $A$ .
Count Edges for B: Vertex $A$ has $3$ edges connected to it. $\newline$ Degree of Vertex $A = 3$
Count Edges for $C$ : Count the edges for vertex $B$ .
Count Edges for D: Vertex B has $2$ edges connected to it. $\newline$ Degree of Vertex B $= 2$
Count Edges for $E$ : Count the edges for vertex $C$ .
Count Edges for F: Vertex C has $4$ edges connected to it. $\newline$ Degree of Vertex C = $4$
Count Edges for F: Vertex $C$ has $4$ edges connected to it. $\newline$ Degree of Vertex $C = 4$ Count the edges for vertex $D$ .
Count Edges for F: Vertex $C$ has $4$ edges connected to it. $\newline$ Degree of Vertex $C = 4$ Count the edges for vertex $D$ . Vertex $D$ has $1$ edge connected to it. $\newline$ Degree of Vertex $D = 1$
Count Edges for F: Vertex $C$ has $4$ edges connected to it. $\newline$ Degree of Vertex $C = 4$ Count the edges for vertex $D$ . Vertex $D$ has $1$ edge connected to it. $\newline$ Degree of Vertex $D = 1$ Count the edges for vertex $E$ .
Count Edges for F: Vertex $C$ has $4$ edges connected to it. $\newline$ Degree of Vertex $C = 4$ Count the edges for vertex $D$ . Vertex $D$ has $1$ edge connected to it. $\newline$ Degree of Vertex $D = 1$ Count the edges for vertex $E$ . Vertex $E$ has $3$ edges connected to it. $\newline$ Degree of Vertex $4$ $0$
Count Edges for F: Vertex C has $4$ edges connected to it. $\newline$ Degree of Vertex C = $4$ Count the edges for vertex D.Vertex D has $1$ edge connected to it. $\newline$ Degree of Vertex D = $1$ Count the edges for vertex E.Vertex E has $3$ edges connected to it. $\newline$ Degree of Vertex E = $3$ Count the edges for vertex F.
Count Edges for F: Vertex $C$ has $4$ edges connected to it. $\newline$ Degree of Vertex $C = 4$ Count the edges for vertex $D$ . Vertex $D$ has $1$ edge connected to it. $\newline$ Degree of Vertex $D = 1$ Count the edges for vertex $E$ . Vertex $E$ has $3$ edges connected to it. $\newline$ Degree of Vertex $4$ $0$ Count the edges for vertex $4$ $1$ . Vertex $4$ $1$ has $4$ $3$ edges connected to it. $\newline$ Degree of Vertex $4$ $4$