1. Minimal skew energy of oriented unicyclic graphs with a perfect matching.
- Author
-
Jian-ming Zhu and Ju Yang
- Subjects
EIGENVALUES ,MATRICES (Mathematics) ,SKEWNESS (Probability theory) ,PERFECT graphs ,POLYNOMIALS ,MATHEMATICAL inequalities ,MATHEMATICAL analysis - Abstract
Let G
σ be an oriented graph of a simple undirected graph G with an orientation σ, which assigns to each edge of G a direction so that the resultant graph Gσ becomes a directed graph. The skew energy of Gσ is defined as the sum of the absolute values of all eigenvalues of the skew-adjacency matrix of Gσ . Denote by Uσ (2k) the set of all oriented unicyclic graphs on 2k vertices with a perfect matching which contain no cycle of length l with l ≡ 2(mod 4). In this paper, we characterize the oriented graphs of Uσ (2k) with the minimal skew energy for k ≥ 4. [ABSTRACT FROM AUTHOR]- Published
- 2014
- Full Text
- View/download PDF