On eigenvectors of mixed graphs with exactly one nonsingular cycle
Let be a mixed graph. The eigenvalues and eigenvectors of are respectively defined to be those of its Laplacian matrix. If is a simple graph, [M. Fiedler: A property of eigenvectors of nonnegative symmetric matrices and its applications to graph theory, Czechoslovak Math. J. 25 (1975), 619–633] gave a remarkable result on the structure of the eigenvectors of corresponding to its second smallest eigenvalue (also called the algebraic connectivity of ). For being a general mixed graph with...