A graph G has m vertices of odd degree and n | vedclass

Name: Exam Paper Generator | JEE NEET Paper Generator | Vedclass
Brand: Vedclass
Rating: 5 (35 reviews)

Question

(B) According to the Handshaking Lemma,the sum of the degrees of all vertices in a graph is equal to twice the number of edges,which is an even number

Vedclass · Accepted Answer

$m$ is an even number

Vedclass · Answer

(B) According to the Handshaking Lemma,the sum of the degrees of all vertices in a graph is equal to twice the number of edges,which is an even number.Let $V_{odd}$ be the set of vertices with odd degree and $V_{even}$ be the set of vertices with even degree.The sum of degrees is $\sum_{v \in V_{odd}} 	ext{deg}(v) + \sum_{v \in V_{even}} 	ext{deg}(v) = 2|E|$.Since $\sum_{v \in V_{even}} 	ext{deg}(v)$ is always even,the sum $\sum_{v \in V_{odd}} 	ext{deg}(v)$ must also be even for the total sum to be even.For the sum of $m$ odd numbers to be even,$m$ must be an even number.Therefore,the number of vertices of odd degree,$m$,is always even.

$A$ graph $G$ has $m$ vertices of odd degree and $n$ vertices of even degree. Then which of the following statements is necessarily true?

Similar Questions

Write the following set in roster form:
$D = \{ x : x \text{ is a prime number which is a divisor of } 60 \}$

List all the elements of the following set:
$A = \{ x:x \text{ is an odd natural number} \}$

Given the sets $A = \{1, 3, 5\}$,$B = \{2, 4, 6\}$,and $C = \{0, 2, 4, 6, 8\}$,which of the following sets can be considered as a universal set for all three sets $A$,$B$,and $C$?

Let $S = \{ 0, 1, 5, 4, 7 \}$. Then the total number of subsets of $S$ is

If $A = \{1, 2, 3, 4, 5\}$,then the number of proper subsets of $A$ is

Vedclass Test Series

Exam Paper Generator

Online Exam Module