AbstractLet G be a nonsingular connected mixed graph. We determine the mixed graphs G on at least seven vertices with exactly two Laplacian eigenvalues greater than 2. In addition, all mixed graphs G with exactly one Laplacian eigenvalue greater than 2 are also characterized
In this paper we consider the graphs having at most two (signless) Laplacian eigenvalues greater tha...
In this paper we consider the graphs having at most two (signless) Laplacian eigenvalues greater tha...
In this paper we consider the graphs having at most two (signless) Laplacian eigenvalues greater tha...
This paper determines all nonsingular unicyclic mixed graphs on at least nine vertices with at most ...
This paper determines all nonsingular unicyclic mixed graphs on at least nine vertices with at most ...
AbstractLet G be a nonsingular connected mixed graph. We determine the mixed graphs G on at least se...
AbstractIn this paper, we firstly give an upper bound for the second smallest Laplacian eigenvalue o...
AbstractAll connected graphs with exactly one or two Laplacian eigenvalues greater than two are dete...
summary:Let $G$ be a mixed graph. The eigenvalues and eigenvectors of $G$ are respectively defined...
AbstractIn this paper, we firstly give an upper bound for the second smallest Laplacian eigenvalue o...
summary:Let $G$ be a mixed graph. The eigenvalues and eigenvectors of $G$ are respectively defined...
AbstractIn this paper, all connected graphs with the fourth largest Laplacian eigenvalue less than t...
summary:Let $G$ be a mixed graph. The eigenvalues and eigenvectors of $G$ are respectively defined...
AbstractLet G be a mixed graph and let L(G) be the Laplacian matrix of the graph G. The first eigenv...
Using the result on Fiedler vectors of a simple graph, we obtain a property on the structure of the ...
In this paper we consider the graphs having at most two (signless) Laplacian eigenvalues greater tha...
In this paper we consider the graphs having at most two (signless) Laplacian eigenvalues greater tha...
In this paper we consider the graphs having at most two (signless) Laplacian eigenvalues greater tha...
This paper determines all nonsingular unicyclic mixed graphs on at least nine vertices with at most ...
This paper determines all nonsingular unicyclic mixed graphs on at least nine vertices with at most ...
AbstractLet G be a nonsingular connected mixed graph. We determine the mixed graphs G on at least se...
AbstractIn this paper, we firstly give an upper bound for the second smallest Laplacian eigenvalue o...
AbstractAll connected graphs with exactly one or two Laplacian eigenvalues greater than two are dete...
summary:Let $G$ be a mixed graph. The eigenvalues and eigenvectors of $G$ are respectively defined...
AbstractIn this paper, we firstly give an upper bound for the second smallest Laplacian eigenvalue o...
summary:Let $G$ be a mixed graph. The eigenvalues and eigenvectors of $G$ are respectively defined...
AbstractIn this paper, all connected graphs with the fourth largest Laplacian eigenvalue less than t...
summary:Let $G$ be a mixed graph. The eigenvalues and eigenvectors of $G$ are respectively defined...
AbstractLet G be a mixed graph and let L(G) be the Laplacian matrix of the graph G. The first eigenv...
Using the result on Fiedler vectors of a simple graph, we obtain a property on the structure of the ...
In this paper we consider the graphs having at most two (signless) Laplacian eigenvalues greater tha...
In this paper we consider the graphs having at most two (signless) Laplacian eigenvalues greater tha...
In this paper we consider the graphs having at most two (signless) Laplacian eigenvalues greater tha...
DOI
Add to ORKG