How many perfect matchings are there in a complete graph of 6 vertices?

$$A$$ graph $$G$$ $$=$$ $$(V, E)$$ satisfies $$\left| E \right| \le \,3\left| V \right| - 6.$$ The min-degree of $$G$$ is defined as $$\mathop {\min }\limits_{v \in V} \left\{ {{{\mathop{\rm d}\nolimits} ^ \circ }egree\left( v \right)} \right\}$$. Therefore, min-degree of $$G$$ cannot be

Consider the following system of linear equations $$$\left[ {\matrix{ 2 & 1 & { - 4} \cr 4 & 3 & { - 12} \cr 1 & 2 & { - 8} \cr } } \right]\left[ {\matrix{ x \cr y \cr z \cr } } \right] = \left[ {\matrix{ \alpha \cr 5 \cr 7 \cr } } \right]$$$

Notice that the second and the third columns of the coefficient matrix are linearly dependent. For how many values of $$\alpha $$, does this system of equations have infinitely many solutions?

Let $$G$$ be an arbitrary graph with $$n$$ nodes and $$k$$ components. If a vertex is removed from $$G$$, the number of components in the resultant graph must necessarily lie between