Spectral norm of oriented graphs
From MaRDI portal
Publication:2419052
DOI10.1016/j.laa.2019.03.021zbMath1411.05163OpenAlexW2923656371WikidataQ128135648 ScholiaQ128135648MaRDI QIDQ2419052
Juan Monsalve, Carlos Hoppen, Vilmar Trevisan
Publication date: 29 May 2019
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2019.03.021
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)
Related Items (4)
Unnamed Item ⋮ Lower bounds for the spectral norm of digraphs ⋮ The first three largest values of the spectral norm of oriented bicyclic graphs ⋮ Energy of a digraph with respect to a VDB topological index
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Skew-adjacency matrices of graphs
- Some results on the spectral radius of generalized \(\infty\) and \(\theta\)-digraphs
- Bicyclic digraphs with maximal energy
- Spectra of digraphs
- Graphs with given degree sequence and maximal spectral radius
- Digraphs with large maximum Wiener index
- Relation between the skew energy of an oriented graph and its matching number
- The skew energy of a digraph
- Lower bounds of the skew spectral radii and skew energy of oriented graphs
- A note on the spectral characterization of strongly connected bicyclic digraphs
- On the eigenvalues of trees
- On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
- Singular values of tournament matrices
- Spectral Radius of Graphs
- Ordering trees by their largest eigenvalues
- Skew-rank of an oriented graph in terms of matching number
- Relation between the skew-rank of an oriented graph and the rank of its underlying graph
This page was built for publication: Spectral norm of oriented graphs
