Some inequalities on the skew-spectral radii of oriented graphs
From MaRDI portal
Publication:385874
DOI10.1186/1029-242X-2012-211zbMATH Open1277.05113OpenAlexW2098350537WikidataQ59290933 ScholiaQ59290933MaRDI QIDQ385874FDOQ385874
Authors: Guang-Hui Xu
Publication date: 11 December 2013
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/1029-242x-2012-211
Recommendations
- On oriented graphs whose skew spectral radii do not exceed 2
- Ordering the oriented unicyclic graphs whose skew-spectral radius is bounded by 2
- The oriented bicyclic graphs whose skew-spectral radii do not exceed 2
- Lower bounds of the skew spectral radii and skew energy of oriented graphs
- Oriented graphs whose skew spectral radius does not exceed 2
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Cited In (29)
- On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
- The oriented bicyclic graphs whose skew-spectral radii do not exceed 2
- Upper bounds for the largest singular value of certain digraph matrices
- Some relations between the skew spectrum of an oriented graph and the spectrum of certain closely associated signed graphs
- About the spectra of a real nonnegative matrix and its signings
- The skew spectral radius and skew Randić spectral radius of general random oriented graphs
- Relation between the skew-rank of an oriented graph and the independence number of its underlying graph
- On the relationship between the skew-rank of an oriented graph and the rank of its underlying graph
- Oriented graphs determined by their generalized skew spectrum
- Bicyclic oriented graphs with skew-rank 2 or 4
- Relation between the skew-rank of an oriented graph and the rank of its underlying graph
- Skew-rank of an oriented graph in terms of matching number
- Oriented graphs whose skew spectral radius does not exceed 2
- Solution to a conjecture on the maximum skew-spectral radius of odd-cycle graphs
- Lower bounds of the skew spectral radii and skew energy of oriented graphs
- Note on the skew energy of oriented graphs
- Ordering the oriented unicyclic graphs whose skew-spectral radius is bounded by 2
- On oriented graphs whose skew spectral radii do not exceed 2
- On skew Laplacian spectrum and energy of digraphs
- Bounds for the skew Laplacian (skew adjacency) spectral radius of a digraph
- On real or integral skew Laplacian spectrum of digraphs
- On mixed graphs whose Hermitian spectral radii are at most 2
- Title not available (Why is that?)
- On the skew spectral moments of graphs
- Title not available (Why is that?)
- On the skew-spectral distribution of randomly oriented graphs.
- Spectral norm of oriented graphs
- Skew-rank of an oriented graph with edge-disjoint cycles
- Solution to a problem on skew spectral radii of oriented graphs
This page was built for publication: Some inequalities on the skew-spectral radii of oriented graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q385874)