Upper bound for the trace norm of the Laplacian matrix of a digraph and normally regular digraphs
From MaRDI portal
(Redirected from Publication:1754435)
Recommendations
- A spectral excess theorem for digraphs with normal Laplacian matrices
- scientific article; zbMATH DE number 6746062
- Bounds on normalized Laplacian eigenvalues of graphs
- Bounds on normalized Laplacian eigenvalues of graphs
- A new upper bound for eigenvalues of the Laplacian matrix of a graph
- On the restricted numerical range of the Laplacian matrix for digraphs
- Upper bound for the Laplacian graph eigenvalues
- Some new upper and lower bound on the spectral radius of the signless Laplacian matrix of a digraph
- The trace norm of r-partite graphs and matrices
- On upper bounds for Laplacian graph eigenvalues
Cites work
- Beyond graph energy: norms of graphs and matrices
- Complex adjacency matrix and energy of digraphs
- Energy of digraphs
- Energy of matrices
- Energy of signed digraphs
- Energy of weighted digraphs
- Extremal norms of graphs and matrices
- Laplacian energy of a graph
- Normally regular digraphs
- The skew energy of a digraph
Cited in
(8)- Upper bounds for the largest singular value of certain digraph matrices
- Hypoenergetic and nonhypoenergetic digraphs
- Minimum arc-cuts of normally regular digraphs and Deza digraphs
- On the \(A_\alpha\)-spectrum of joined union of digraphs
- On the first outdegree Zagreb index of a digraph
- On the trace norms of orientations of graphs
- The trace norm of r-partite graphs and matrices
- Delta invariant for Eulerian digraphs
This page was built for publication: Upper bound for the trace norm of the Laplacian matrix of a digraph and normally regular digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1754435)