A mixed graph MG is obtained from an unoriented simple graph G by giving directions to some edges of G. The Hermitian adjacency matrix of the second kind of MG is defined as N (MG) = (nij), in which nij = nji = 1+2p3i if vi ! vj, nij = 1 if vi $ vj and 0 otherwise. The Hermitian Laplacian matrix (Hermitian quasi-Laplacian matrix) of the second kind of MG is defined as L(MG) = D(MG) N (MG) (Q(MG) = D(MG) + N (MG), respectively), where D(MG) is the degree diagonal matrix of the underlying graph G of MG. In this paper, we derive some necessary and sufficient conditions for the singularity of L(MG) and Q(MG). We also characterize the principal minor version of Matrix-Tree theorem based on L(MG) and Q(MG). As a consequence, we give the explicit expressions for the determinants of two matrices L(MG) and Q(MG) for MG.