$1.$ degree of a vertex $2.$Totally ordered set $3.$ spanning tree $4.$ complete graph $5.$ well ordered set $6.$ simple graph $7.$ directed graph $8.$ edge connectivity $9.$ reflexive coosure of R $10.$ Literal $11.$ simple circuit $12.$ minterm $13.$ vertex connectivity $14.$ full binary tree $15.$ path in graph. Question $30$ options:

From the above list match the number of the name with the definitions below. Note: there are more labels $(1$ to $15)$ than definitions and that a given label only gets used once. The smallest reflexive relation that contains R$.$

A Poset where every pair of elements are comparable.

A graph with no loops or multiple edges.

A set V and a set E of ordered pairs of elements of V$.$

Every vertex is adjacent to every other vertex.

The least number of vertices in a vertex cut.

A path from a vertex to itself with no repeated edges.

A Boolean variable or its complement.

Every internal vertex has exactly $2$ children.

A subgraph with no circuits that contains every vertex.