University of Isfahan Transactions on Combinatorics 2251-8657 6 1 2017 03 01 On the skew spectral moments of graphs 47 54 20737 10.22108/toc.2017.20737 EN Fatemeh Taghvaee University of Kashan Gholam Hossein Fath-Tabar University of Kashan Journal Article 2016 02 10 Let $G$ be a simple graph‎, ‎and $G^{\sigma}$‎ ‎be an oriented graph of $G$ with the orientation ‎$\sigma$ and skew-adjacency matrix $S(G^{\sigma})$‎. ‎The $k-$th skew spectral‎ ‎moment of $G^{\sigma}$‎, ‎denoted by‎ ‎$T_k(G^{\sigma})$‎, ‎is defined as $\sum_{i=1}^{n}( ‎‎‎\lambda_{i})^{k}$‎, ‎where $\lambda_{1}‎, ‎\lambda_{2},\cdots‎, ‎\lambda_{n}$ are the eigenvalues of $G^{\sigma}$‎. ‎Suppose‎ ‎$G^{\sigma_1}_{1}$ and $G^{\sigma_2}_{2}$ are two digraphs‎. ‎If there‎ ‎exists an integer $k$‎, ‎$1 \leq k \leq n-1$‎, ‎such that for each‎ ‎$i$‎, ‎$0 \leq i \leq k-1$‎, ‎$T_i(G^{\sigma_1}_{1}) =‎ ‎T_i(G^{\sigma_2}_{2})$ and‎ ‎$T_k(G^{\sigma_1}_{1}) <T_k(G^{\sigma_ 2}_{2})$‎ ‎then we write‎ ‎$G^{\sigma_1}_{1} \prec_{T} G^{\sigma_2}_{2}$‎.<br /> ‎In this paper‎, ‎we determine some of the skew spectral moments of oriented graphs‎. ‎Also we order some oriented unicyclic graphs with respect to skew spectral moment‎. https://toc.ui.ac.ir/article_20737_9c81a151b424aac06fc6253943dc89a2.pdf