The Laplacian eigenvalues of mixed graphs
From MaRDI portal
Publication:1863571
DOI10.1016/S0024-3795(02)00509-8zbMath1017.05078MaRDI QIDQ1863571
Publication date: 11 March 2003
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Related Items (23)
On the spectrum of 3-coloured digraphs ⋮ Nonsingular mixed graphs with few eigenvalues greater than two ⋮ A note on the upper bounds for the Laplacian spectral radius of graphs ⋮ On the spectrum of some signed complete and complete bipartite graphs ⋮ Some families of integral mixed graphs ⋮ On spectral invariants of the \(\alpha\)-mixed adjacency matrix ⋮ Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order ⋮ On weighted directed graphs ⋮ On edge singularity and eigenvectors of mixed graphs ⋮ Hermitian-adjacency matrices and Hermitian energies of mixed graphs ⋮ Unoriented Laplacian maximizing graphs are degree maximal ⋮ Singularity of Hermitian (quasi-)Laplacian matrix of mixed graphs ⋮ Sharp upper and lower bounds for the Laplacian spectral radius and the spectral radius of graphs ⋮ On upper bounds for Laplacian graph eigenvalues ⋮ Bounds on the index of the signless Laplacian of a graph ⋮ Largest eigenvalue of a unicyclic mixed graphs ⋮ On signed graphs whose second largest Laplacian eigenvalue does not exceed 3 ⋮ Graphs with maximal signless Laplacian spectral radius ⋮ Bounds for the Laplacian spectral radius of graphs ⋮ A sharp upper bound for the spectral radius of a nonnegative matrix and applications ⋮ Skewed converse and Laplacian spectral radius of weighted directed graphs ⋮ An improved upper bound for the Laplacian spectral radius of graphs ⋮ Bounds for the Laplacian spectral radius of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- A note on Laplacian graph eigenvalues
- Laplacian matrices of graphs: A survey
- An always nontrivial upper bound for Laplacian graph eigenvalues
- Matrix Analysis
- Generalized matrix tree theorem for mixed graphs
- The edge chromatic number of a directed/mixed multigraph
- The Laplacian Spectrum of a Graph II
- Edge version of the matrix tree theorem for trees
- de Caen's inequality and bounds on the largest Laplacian eigenvalue of a graph
This page was built for publication: The Laplacian eigenvalues of mixed graphs