Spectra of signed graphs and related oriented graphs
An oriented or a signed graph is connected, regular, or bipartite if the same holds for its underlying graph. Similarly, a matching (or a perfect matching) refers to the matching in the underlying graph. The theory of spectra of oriented graphs is strongly connected to the theory of spectra of signed graphs, and many problems concerning spectral parameters of oriented graphs can be transferred to the framework of signed graphs, where the entire theory of real symmetric matrices can be employed. For every oriented graph \(G^\prime\), there exists a bipartite signed graph \(H^\prime\) such that the spectrum of \(H^\prime\) contains the full information about the spectrum of the skew adjacency matrix of \(G^\prime\). This approach allows the author to transfer certain problems related to the skew eigenvalues of oriented graphs into the framework of signed graphs. In this framework, the theory of real symmetric matrices can be utilized. The main result is a crucial relation between the spectrum of an oriented graph and the spectrum of a related signed graph. In this work, the author continues his previous research by relating the characteristic polynomials, eigenspaces, and energy of \(G^\prime\) to those of \(H^\prime\). At the same time, he addresses several open problems concerning the skew eigenvalues of oriented graphs. The author addresses the problems [\textit{C. Adiga} et al., Linear Algebra Appl. 432, No. 7, 1825--1835 (2010; Zbl 1217.05131)] related to the existence of skew-symmetric conference matrices that do not give the maximum energy of the corresponding oriented graph. It is an interesting paper that is useful to researchers working in this area.
- Relations between the skew spectrum of an oriented graph and the spectrum of an associated signed graph
- Some relations between the skew spectrum of an oriented graph and the spectrum of certain closely associated signed graphs
- Skew spectra of oriented graphs
- Characteristic polynomials of skew-adjacency matrices of oriented graphs
- Skew spectra of oriented bipartite graphs
- A decomposition of signed graphs with two eigenvalues
- Characteristic polynomials of skew-adjacency matrices of oriented graphs
- Characterizations of signed graphs
- scientific article; zbMATH DE number 47671 (Why is no real title available?)
- Integer symmetric matrices having all their eigenvalues in the interval \([ - 2,2]\)
- On signed graphs with just two distinct adjacency eigenvalues
- On strongly regular signed graphs
- On the Laplacian coefficients of signed graphs
- On the skew energy of orientations of hypercubes
- On the skew spectra of Cartesian products of graphs
- Oriented graphs whose skew spectral radius does not exceed 2
- Relations between the skew spectrum of an oriented graph and the spectrum of an associated signed graph
- Signed (0,2)‐graphs with few eigenvalues and a symmetric spectrum
- Signed graphs
- Signed graphs with two eigenvalues and vertex degree five
- Skew spectra of oriented bipartite graphs
- Skew spectrum of the Cartesian product of an oriented graph with an oriented hypercube
- Skew-adjacency matrices of graphs
- Some relations between the skew spectrum of an oriented graph and the spectrum of certain closely associated signed graphs
- Spectra of signed graphs with two eigenvalues
- The skew energy of a digraph
This page was built for publication: Spectra of signed graphs and related oriented graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6650515)
