73.7k views
5 votes
use the theorem that relates the sum of degrees to the number of edges to determine the number of edges in the graph (without drawing the graph) a graph with 4 vertices, each of 2 degree 2

1 Answer

4 votes

\begin{gathered} \text{Handshaking theorem} \\ Sum\text{ of degre}e\text{ of all the vertices=2}* Number\text{ of vertices} \\ So,\text{ } \\ n*2=2*4 \\ n=4(nu\text{mber of edge)} \end{gathered}

User Andre Hofmeister
by
9.3k points

No related questions found

Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.

9.4m questions

12.2m answers

Categories