COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
True
|
|
|
False
|
|
|
Either A or B
|
|
|
None of the above
|
Detailed explanation-1: -False. Was this answer helpful?
Detailed explanation-2: -In a simple graph, the number of edges is equal to twice the sum of the degrees of the vertices. Explanation: The sum of the degrees of the vertices is equal to twice the number of edges. 7.
Detailed explanation-3: -1 Answer. Best explanation: In a walk if the vertices are distinct it is called a path, whereas if the edges are distinct it is called a trail.
Detailed explanation-4: -Commenting on the statement of the Handshaking theorem, we can say that according to this theorem, the number of edges on the graph is half the sum of degrees of the vertices.
Detailed explanation-5: -Unless specified otherwise, we will only deal with simple, undirected graphs. Proof: Prove that the sum of degrees of all nodes in a graph is twice the number of edges. Solution 1: Since each edge is incident to exactly two vertices, each edge contributes two to the sum of degrees of the vertices.