Characteristic polynomials of skew-adjacency matrices of oriented graphs
An oriented graph \(G^\sigma \) is a simple undirected graph \(G\) with an orientation, which assigns to each edge a direction so that \(G^\sigma \) becomes a directed graph. \(G\) is called the underlying graph of \(G^\sigma \) and we denote by \(S(G^\sigma )\) the skew-adjacency matrix of \(G^\sigma \) and its spectrum \(Sp(G^\sigma )\) is called the skew-spectrum of \(G^\sigma \). For the concept of the skew-energy of a simple directed graph see [\textit{C. Adiga}, \textit{R. Balakrishnan}, and \textit{W. So}, ``The skew energy of a digraph, Linear Algebra Appl. 432, No.\,7, 1825--1835 (2010; Zbl 1217.05131)], which gave the motivation for this paper. Here the coefficients of the characteristic polynomial of the skew-adjacency matrix \(S(G^\sigma )\) are given in terms of \(G^\sigma \) and as its applications, new combinatorial proofs of known results are obtained and new families of oriented bipartite graphs \(G^\sigma \) with \(Sp(G^\sigma ) = \mathbf iSp(G)\) are given.
- Skew spectra of oriented graphs
- On the skew spectra of Cartesian products of graphs
- The characteristic polynomial and the matchings polynomial of a weighted oriented graph
- Permanental polynomials of skew adjacency matrices of oriented graphs
- Some relations between the skew spectrum of an oriented graph and the spectrum of certain closely associated signed graphs
- Skew-signings of positive weighted digraphs
- Ordering of oriented unicyclic graphs by skew energies
- Oriented unicyclic graphs with the first \(\lfloor\frac {n-9}{2}\rfloor\) largest skew energies
- A note on the spectra of certain skew-symmetric \(\{1,0,-1\}\)-matrices
- On the skew spectra of Cartesian products of graphs
- Optimum skew energy of a tournament
- Oriented graphs determined by their generalized skew spectrum
- The asymptotic normality of adjacency coefficients of bipartite graphs and skew-adjacency coefficients of oriented graphs
- The number of the skew-eigenvalues of digraphs and their relationship with optimum skew energy
- On the characteristic polynomials and \(H\)-ranks of the weighted mixed graphs
- Skew spectra of oriented graphs
- Minimal skew energy of oriented unicyclic graphs with a perfect matching
- Upper bound of skew energy of an oriented graph in terms of its skew rank
- Skew-rank of an oriented graph and independence number of its underlying graph
- On oriented graphs whose skew spectral radii do not exceed 2
- 4-regular oriented graphs with optimum skew energy
- Skew spectra of graphs without even cycles
- The oriented bicyclic graphs whose skew-spectral radii do not exceed 2
- On the characteristic polynomial of skew gain graphs
- On the skew-permanental polynomials of orientation graphs
- Bicyclic oriented graphs with skew-rank 2 or 4
- A note on skew spectrum of graphs.
- The skew energy of random oriented graphs
- Skew spectra of oriented bipartite graphs
- Bicyclic oriented graphs with the second largest skew-energy
- The characteristic polynomial and the matchings polynomial of a weighted oriented graph
- Skew-adjacency matrices of graphs
- On the rank of a real skew symmetric matrix described by an oriented graph
- Properties of characteristic polynomials of oriented graphs
- Tricyclic oriented graphs with maximal skew energy
- On the adjacency matrix of a complex unit gain graph
- Some relations between the skew spectrum of an oriented graph and the spectrum of certain closely associated signed graphs
- On the skew spectral moments of graphs
- scientific article; zbMATH DE number 7276877 (Why is no real title available?)
- Hermitian-Randić matrix and Hermitian-Randić energy of mixed graphs
- \(\alpha\)-adjacency: a generalization of adjacency matrices
- Solution to a problem on skew spectral radii of oriented graphs
- Permanental polynomials of skew adjacency matrices of oriented graphs
- About the spectra of a real nonnegative matrix and its signings
- On the mixed adjacency matrix of a mixed graph
- 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
- Note on skew-eigenvalues of digraphs
- Smith normal form and the generalized spectral characterization of oriented graphs
- Characteristic polynomials of oriented graphs
- On the skew spectral moments of trees and unicyclic graphs
- On the coefficients of skew Laplacian characteristic polynomial of digraphs
- Spectra of signed graphs and related oriented graphs
- Determinants of Seidel tournament matrices
- 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
This page was built for publication: Characteristic polynomials of skew-adjacency matrices of oriented graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q640406)
