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
AbstractIn this paper, all connected graphs with the fourth largest Laplacian eigenvalue less than t...
V magistrski nalogi obravnavamo spektralno teorijo enostavnih in mešanih grafov. Za Laplaceove matri...
In this article we provide a combinatorial description of an arbitrary minor of the Laplacian matrix...
AbstractLet G be a nonsingular connected mixed graph. We determine the mixed graphs G on at least se...
summary:Let $G$ be a mixed graph. The eigenvalues and eigenvectors of $G$ are respectively defined...
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...
AbstractLet G be a mixed graph and let L(G) be the Laplacian matrix of the graph G. The first eigenv...
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...
AbstractIn this paper, we characterize the mixed graphs with exactly one Laplacian eigenvalue moving...
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 ...
AbstractAll connected graphs with exactly one or two Laplacian eigenvalues greater than two are dete...
AbstractThe study of a mixed graph and its Laplacian matrix have gained quite a bit of interest amon...
AbstractIn this paper, all connected graphs with the fourth largest Laplacian eigenvalue less than t...
V magistrski nalogi obravnavamo spektralno teorijo enostavnih in mešanih grafov. Za Laplaceove matri...
In this article we provide a combinatorial description of an arbitrary minor of the Laplacian matrix...
AbstractLet G be a nonsingular connected mixed graph. We determine the mixed graphs G on at least se...
summary:Let $G$ be a mixed graph. The eigenvalues and eigenvectors of $G$ are respectively defined...
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...
AbstractLet G be a mixed graph and let L(G) be the Laplacian matrix of the graph G. The first eigenv...
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...
AbstractIn this paper, we characterize the mixed graphs with exactly one Laplacian eigenvalue moving...
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 ...
AbstractAll connected graphs with exactly one or two Laplacian eigenvalues greater than two are dete...
AbstractThe study of a mixed graph and its Laplacian matrix have gained quite a bit of interest amon...
AbstractIn this paper, all connected graphs with the fourth largest Laplacian eigenvalue less than t...
V magistrski nalogi obravnavamo spektralno teorijo enostavnih in mešanih grafov. Za Laplaceove matri...
In this article we provide a combinatorial description of an arbitrary minor of the Laplacian matrix...