Consider a semigraph $G=(V,\,E)$; in this paper, we study the eigenvalues of the Laplacian matrix of $G$. We show that the Laplacian of $G$ is positive semi-definite, and $G$ is connected if and only if $λ_2 >0.$ Along the similar lines of graph theory bounds on the largest eigenvalue, we obtain upper and lower bounds on the largest Laplacian eigenvalue of G and enumerate the Laplacian eigenvalues of some special semigraphs such as star semigraph, rooted 3-uniform semigraph tree.