How many edges are there in a graph with 10 vertices each of degree six?
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: D. 30
Explanation
By the handshaking lemma, the sum of the degrees of all vertices in a graph equals twice the number of edges. Here there are 10 vertices each of degree 6, so the sum of all degrees is 10 × 6 = 60. The number of edges is therefore 60 / 2 = 30.More Discrete Structures and Optimization questions
- Arrange the following in ascending order on the basis of number of distinct prime numbers in their prime factorization. A. 729 B. 1001 C. 1…
- Which of the following additional properties is supposed to be satisfied by a group (G, *) to be an abelian group?
- Suppose P(·) is used for power set and ∅ is the usual notation of empty set. Arrange the following on the basis of their cardinality in non…
- Match the LIST-I with LIST-II. Match the equivalent propositions in List-I and List-II LIST-I LIST-II A. P→(Q→P) I. (P∨Q)∧¬(P∧Q) B. P→(Q∨R)…
- Match the LIST-I with LIST-II.LIST-I LIST-II A. Commutative law I. P∧(Q∨R) = (P∧Q)∨(P∧R) B. Distributive law II. P∧(P∨Q) = P C. Demorgan la…
- Let and be subgroups of group . Which of the following is False?