A new criterion for oriented graphs to be determined by their generalized skew spectrum

Abstract

Spectral characterization of graphs is an important topic in spectral graph theory which has been studied extensively by researchers in recent years. The study of oriented graphs, however, has received less attention so far. In Qiu et al. (2021) [6], the authors gave an arithmetic criterion for an oriented graph to be determined by its generalized skew spectrum (DGSS for short). More precisely, let Σ be an n-vertex oriented graph with skew adjacency matrix S and $W\left(\Sigma \right)=[e,Se,\dots ,S^{n-1}e]$ be the walk-matrix of Σ, where e is the all-one vector. A theorem of Qiu et al. [6] shows that a self-converse oriented graph Σ is DGSS, provided that the Smith normal form of $W\left(\Sigma \right)$ is $\mathrm{diag}(1,\dots ,1,2,\dots ,2,2d)$, where d is an odd and square-free integer and the number of 1's appeared in the diagonal is precisely $\lceil \frac{n}{2}\rceil$. In this paper, we show that the above square-freeness assumptions on d can actually be removed, which significantly improves upon the above theorem. Our new ingredient is a key intermediate result, which is of independent interest: for a self-converse oriented graphs Σ and an odd prime p, if the rank of $W\left(\Sigma \right)$ is $n-1$ over $F_p$, then the kernel of $W{\left(\Sigma \right)}^T$ over $F_p$ is anisotropic, i.e., $v^{T}v\ne 0$ for any $0\ne v\in \ker W{\left(\Sigma \right)}^T$ over $F_p$.