Lower bounds for the spectral norm of digraphs
From MaRDI portal
Publication:2656645
DOI10.1016/j.laa.2021.01.008zbMath1459.05170OpenAlexW3127402361MaRDI QIDQ2656645
Juan Rada, Juan Monsalve, Jazmín García
Publication date: 16 March 2021
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2021.01.008
splitting digraphstrace norm of digraphsalmost regular digraphsspectral norm of digraphsspectral radius of digraphs
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)
Related Items (3)
The first three largest values of the spectral norm of oriented bicyclic graphs ⋮ Energy and Randić index of directed graphs ⋮ Energy of a digraph with respect to a VDB topological index
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lower bounds of Nikiforov's energy over digraphs
- Extremal values of the trace norm over oriented trees
- Spektren endlicher Grafen
- The energy of graphs and matrices
- On the energy of \((0, 1)\)-matrices
- Spectra of digraphs
- A note on almost regular matrices
- Extremal values of energy over oriented bicyclic graphs
- Spectra and eigenspaces from regular partitions of Cayley (di)graphs of permutation groups
- On the characterization of digraphs with given rank
- Zeta-equivalent digraphs: simultaneous cospectrality
- The \(A_\alpha\) spectral radius and maximum outdegree of irregular digraphs
- The spectra of lifted digraphs
- Characterizing identifying codes from the spectrum of a graph or digraph
- Spectral norm of oriented graphs
- An upper bound for the energy of radial digraphs
- Graph Energy
- Two shorter proofs in spectral graph theory
- Spectral Radius and Degree Sequence
- Oriented bipartite graphs with minimal trace norm
- Lower bounds for the energy of weighted digraphs
- A Note on Almost Regular Graphs
- On spectra and real energy of complex weighted digraphs
- Maximal energy graphs
This page was built for publication: Lower bounds for the spectral norm of digraphs