Upper bounds for the largest singular value of certain digraph matrices
From MaRDI portal
Publication:2021668
Recommendations
- On the sum of \(k\) largest singular values of graphs and matrices
- The undirected graph and estimates of matrix singular values
- The upper bounds for the largest Laplacian eigenvalue of graphs
- The digraphs and inclusion intervals of matrix singular value.
- A sharp upper bound on the largest eigenvalue of the Laplacian matrix of a graph
- Some new upper and lower bound on the spectral radius of the signless Laplacian matrix of a digraph
- Some bounds on the largest eigenvalues of graphs
- Upper bounds for the largest eigenvalues of a bipartite graph
- Upper bound for the trace norm of the Laplacian matrix of a digraph and normally regular digraphs
- An upper bound on the sum of the k largest eigenvalues of the signless Laplacian matrix of a graph
Cites work
- A new upper bound for the Laplacian spectral radius of graphs
- Bounds for the skew Laplacian (skew adjacency) spectral radius of a digraph
- Graphs and Hermitian matrices: eigenvalue interlacing
- scientific article; zbMATH DE number 7238213 (Why is no real title available?)
- Inequalities for Graph Eigenvalues
- Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
- Some inequalities on the skew-spectral radii of oriented graphs
- Spectra of digraphs
Cited in
(3)
This page was built for publication: Upper bounds for the largest singular value of certain digraph matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2021668)