Sum of degrees of all nodes for a graph G(V, E) can be given by ...... .
एक ग्राफ G(V, E) के लिए सभी नोड्स की डिग्रीज का योग ......... के द्वारा दिया जा सकता है।
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: B. 2 × |E|
Explanation
Handshaking lemma: every edge adds 1 to the degree of each of its two end vertices, so the sum of all degrees = 2|E|.
हैंडशेकिंग लेम्मा: हर किनारा (edge) अपने दोनों सिरों की डिग्री में 1-1 जोड़ता है, अतः डिग्रियों का योग = 2|E|।
More Data Structures questions
- In directed graph G(V, E) where V = {P, Q, R, S, T} and E = {PQ, RS, TP, PS, QR, PT, ST, QP, RQ, TS}, the vertex with maximum in- degree is…
- Which of the following recurrence relation is related to worst case time complexity of quick sort ?
- A queue follows ……….. .
- Process of inserting an element in stack is called :
- If the elements 'A', 'B', 'C' and 'D' are placed in a queue and are deleted one at a time, in what order will these elements be removed ?
- In a stack, if a user tries to remove an element from an empty stack, it is called :