Let the number of vertices \(=n\)
Given degree of each vertex \(=3\)
Then, total degree of simple graph \(=3 n\)
We know that,
sum of all degree of simple graph
\(=2 \times\) number of edges in simple graph
\(\Rightarrow 3 n=2 \times(24)\)
\(\Rightarrow n=2 \times 8\)
\(\Rightarrow n=16\)
The sum of the degrees of all vertices in a simple graph is equal to twice the number of edges. Therefore, in this case, the sum of the degrees of all vertices is 2*24 = 48.
Since the degree of each vertex is 3, the number of vertices can be found by dividing the sum of the degrees of all vertices by the degree of each vertex, i.e., 48/3 = 16.
Therefore, the number of vertices in the graph is 16.
Match List-I with List-II
List-I | List-II |
---|---|
(A) \(^{8}P_{3} - ^{10}C_{3}\) | (I) 6 |
(B) \(^{8}P_{5}\) | (II) 21 |
(C) \(^{n}P_{4} = 360,\) then find \(n\). | (III) 216 |
(D) \(^{n}C_{2} = 210,\) find \(n\). | (IV) 6720 |
Choose the correct answer from the options given below:
A wooden block of mass M lies on a rough floor. Another wooden block of the same mass is hanging from the point O through strings as shown in the figure. To achieve equilibrium, the coefficient of static friction between the block on the floor and the floor itself is
Permutation is the method or the act of arranging members of a set into an order or a sequence.
Combination is the method of forming subsets by selecting data from a larger set in a way that the selection order does not matter.