On edge singularity and eigenvectors of mixed graphs (Q928245)

Let \(G\) be a mixed graph which is obtained from an undirected graph by orienting some of its edges. The eigenvalues and eigenvectors of \(G\) are defined to be those of the Laplacian matrix \(L(G)\) of \(G\). As \(L(G)\) is positive semidefinite, the singularity of \(L(G)\) is determined by its least eigenvalue \(\lambda_1(G)\). It is defined a new parameter edge singularity \(\epsilon s(G)\) that reflects the singularity of \(L(G)\), which is the minimum number of edges of \(G\) whose deletion yields that all the components of the resulting graph are singular. In this work some inequalities between \(\epsilon s(G)\) and \(\lambda_1(G)\) are obtained. In the case of \(\epsilon s(G)=1\), it is obtained a property on the structure of the eigenvectors of \(G\) corresponding to \(\lambda_1(G)\), which is similar to the property of Fiedler vectors of a simple graph.