The characteristic polynomial and the matchings polynomial of a weighted oriented graph

Let $G^{\sigma }$ be a weighted oriented graph with skew adjacency matrix $S(G^{\sigma })$. Then $G^{\sigma }$ is usually referred as the weighted oriented graph associated to $S(G^{\sigma })$. Denote by $?(G^{\sigma }\text{;}\lambda )$ the characteristic polynomial of the weighted oriented graph $G^{\sigma }$, which is defined as$?(G^{\sigma }\text{;}\lambda )=\mathit{det}(\lambda I_n-S(G^{\sigma }))=\sum _{i=0}^n{a}_i(G^{\sigma }){\lambda }^{n-i}\text{.}$In this paper, we begin by interpreting all the coefficients of the characteristic polynomial of an arbitrary real skew symmetric matrix in terms of its associated oriented weighted graph. Then we establish recurrences for the characteristic polynomial and deduce a formula on the matchings polynomial of an arbitrary weighted graph. In addition, some miscellaneous results concerning the number of perfect matchings and the determinant of the skew adjacency matrix of an unweighted oriented graph are given.