  We propose a tensor product structure that is compatible with the hypergraph
structure. We define the algebraic connectivity of the $(m+1)$-uniform
hypergraph in this product, and prove the relationship with the vertex
connectivity. We introduce some connectivity optimization problem into the
hypergraph, and solve them with the algebraic connectivity. We introduce the
Laplacian eigenmap algorithm to the hypergraph under our tensor product.
