Answer to Question #198665 in Discrete Mathematics for Parth Godhani

Question #198665

The sum of the values of the degree 𝜎(V) taken over all the vertices v of a graph .G= (V, E), is equal to twice the number of edges i.e.

βˆ‘ 𝜎(𝑣) = 2|E| v∈V.

Write a proof to validate the equation.


1
Expert's answer
2021-05-26T15:31:50-0400

To prove : Sum of degrees of the vertices of any graph is equal to twice of number of edges in the graph.


Proof:

Let "G = (V , E)" be a "(n, m)" graph where n represent number of vertices and m represent number of edges

So, "O(V)=n \\ ;\\ \\ O(E)=m"

Let "v\\in V" be any arbitrary vertex of G

Suppose "\\sigma(V)\\geq1" (degree of V)

then there exist an edge say 'e' incident at v


Let "w\\in V" be such that "e=\\{v,w\\}" (w is the other end point for edge 'e')


Thus the edge 'e' contributes one to the degree of vertex v and one to the degree of vertex w.

Thus each edge contributes two to the degree of vertices of V.

Hence, the sum of degrees of all the vertices is twice the number of edges.


"\\sum\\sigma(v)=2|E|\\ \\ v\\in V\\\\"

[Basically the fact we used in this proof is that each edge in a graph has two end , so each edge gives two degrees to the vertices (one for each vertex)of graph]

No edge "\\implies" No degree

One edge "\\implies" 2 Degree


Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Comments

No comments. Be the first!

Leave a comment

LATEST TUTORIALS
New on Blog
APPROVED BY CLIENTS