Lower bounds of the skew spectral radii and skew energy of oriented graphs
From MaRDI portal
Publication:2348013
Abstract: Let be a graph with maximum degree , and let be an oriented graph of with skew adjacency matrix . The skew spectral radius of is defined as the spectral radius of . The skew spectral radius has been studied, but only few results about its lower bound are known. This paper determines some lower bounds of the skew spectral radius, and then studies the oriented graphs whose skew spectral radii attain the lower bound . Moreover, we apply the skew spectral radius to the skew energy of oriented graphs, which is defined as the sum of the norms of all the eigenvalues of , and denoted by . As results, we obtain some lower bounds of the skew energy, which improve the known lower bound obtained by Adiga et al.
Recommendations
- scientific article; zbMATH DE number 7238213
- Some inequalities on the skew-spectral radii of oriented graphs
- On oriented graphs whose skew spectral radii do not exceed 2
- Upper bound of skew energy of an oriented graph in terms of its skew rank
- Solution to a problem on skew spectral radii of oriented graphs
- Note on the skew energy of oriented graphs
- Bounds for the skew Laplacian (skew adjacency) spectral radius of a digraph
- On oriented graphs with minimal skew energy
- scientific article; zbMATH DE number 7071467
- Skew spectra of oriented graphs
Cites work
- Graph energy
- Graph theory
- On oriented graphs whose skew spectral radii do not exceed 2
- On the spectral radius of graphs
- Ordering the oriented unicyclic graphs whose skew-spectral radius is bounded by 2
- Skew spectra of oriented graphs
- Skew-adjacency matrices of graphs
- Some inequalities on the skew-spectral radii of oriented graphs
- Spectral Radius and Degree Sequence
- The chromatic number of oriented graphs
- The Eigenvalues of a Graph and Its Chromatic Number
- The Gewirtz graph: An exercise in the theory of graph spectra
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- The skew energy of a digraph
Cited in
(18)- Skew Laplacian energy of digraphs
- Relation between the skew energy of an oriented graph and its 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
- Upper bound of skew energy of an oriented graph in terms of its skew rank
- Spectral norm of oriented graphs
- On oriented graphs whose skew spectral radii do not exceed 2
- The oriented bicyclic graphs whose skew-spectral radii do not exceed 2
- On skew Laplacian energy of directed graphs
- Some inequalities on the skew-spectral radii of oriented graphs
- On the maximum skew spectral radius and minimum skew energy of tournaments
- On the skew Laplacian spectral radius of a digraph
- scientific article; zbMATH DE number 7238213 (Why is no real title available?)
- Note on the skew energy of oriented graphs
- Bounds for the skew Laplacian (skew adjacency) spectral radius of a digraph
- Solution to a problem on skew spectral radii of oriented graphs
- scientific article; zbMATH DE number 7071467 (Why is no real title available?)
- The skew spectral radius and skew Randić spectral radius of general random oriented graphs
This page was built for publication: Lower bounds of the skew spectral radii and skew energy of oriented graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2348013)