The　signless　Laplacian　tensor　and　its　H-eigenvalues　for　an　even　uniform　hypergraph　are　introduced　in　this　paper.　Some　fundamental　properties　of　them　for　an　even　uniform　hypergraph　are　obtained.　In　particular,　the　smallest　and　the　largest　H-eigenvalues　of　the　signless　Laplacian　tensor　for　an　even　uniform　hypergraph　are　discussed,　and　their　relationships　to　hypergraph　bipartition,　minimum　degree,　and　maximum　degree　are　described.　As　an　application,　the　bounds　of　the　edge　cut　and　the　edge　connectivity　of　the　hypergraph　involving　the　smallest　and　the　largest　H-eigenvalues　are　presented.