Characteristic Polynomials of Skew-Adjacency Matrices of Oriented Graphs

@article{Hou2011CharacteristicPO,
  title={Characteristic Polynomials of Skew-Adjacency Matrices of Oriented Graphs},
  author={Yaoping Hou and Tiangang Lei},
  journal={Electr. J. Comb.},
  year={2011},
  volume={18}
}
An oriented graph Gσ is a simple undirected graph G with an orientation, which assigns to each edge a direction so that Gσ becomes a directed graph. G is called the underlying graph of Gσ and we denote by S(Gσ) the skew-adjacency matrix of Gσ and its spectrum Sp(Gσ) is called the skew-spectrum of Gσ. In this paper, the coefficients of the characteristic polynomial of the skew-adjacency matrix S(Gσ) are given in terms of Gσ and as its applications, new combinatorial proofs of known results are… CONTINUE READING
Highly Cited
This paper has 17 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Directed intervals and dual of a graph

  • R. M. Tifenbach, S. J. Kirkland
  • Linear Algebra and its Applications 431 (2009…
  • 2011
1 Excerpt

R

  • C. Adiga
  • Balakrishnan and Wasin So, The skew energy of a…
  • 2010
1 Excerpt

Unicyclic graphs with the strong reciprocal eigenvalue property

  • S. Barik, M. Nath, S. Pati, B. K. Sarma
  • Electronic Journal of Linear Algebra 17
  • 2008

On unimodular graphs

  • S. Akbari, S. J. Kirkland
  • Linear Algebra and its Applications 421
  • 2007

On nonsingular trees and a reciprocal eigenvalue property

  • S. Barik, M. Neumann, S. Pati
  • Linear and Mulitilinear Algebra 54
  • 2006
2 Excerpts

Combinatorial Matrix Theory

  • R. A. Brualdi, H. J. Ryser
  • Cambridge University Press, Cambridge
  • 1991

Similar Papers

Loading similar papers…