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.
The number of strictly increasing functions \(f\) from the set \(\{1, 2, 3, 4, 5, 6\}\) to the set \(\{1, 2, 3, ...., 9\}\) such that \(f(i)>i\) for \(1 \le i \le 6\), is equal to:
Match the following:
In the following, \( [x] \) denotes the greatest integer less than or equal to \( x \). 
Choose the correct answer from the options given below:
For x < 0:
f(x) = ex + ax
For x ≥ 0:
f(x) = b(x - 1)2
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.