A new criterion for oriented graphs to be determined by their generalized skew spectrum
Yiquan Chao, Wei Wang, Hao Zhang

TL;DR
This paper improves a spectral characterization criterion for self-converse oriented graphs by removing the square-free restriction on an integer parameter, using properties of the walk-matrix over finite fields.
Contribution
It removes the square-freeness assumption in a spectral criterion for oriented graphs, broadening the class of graphs characterized by their generalized skew spectrum.
Findings
The square-freeness condition on d is unnecessary for the spectral characterization.
The kernel of the walk-matrix transpose is anisotropic over finite fields under certain conditions.
The new criterion applies to a wider class of self-converse oriented graphs.
Abstract
Spectral characterizations 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.~\cite{QWW} (Linear Algebra Appl. 622 (2021) 316-332), the authors gave an arithmetic criterion for an oriented graph to be determined by its \emph{generalized skew spectrum} (DGSS for short). More precisely, let be an -vertex oriented graph with skew adjacency matrix and be the \emph{walk-matrix} of , where is the all-one vector. A theorem of Qiu et al.~\cite{QWW} shows that a self-converse oriented graph is DGSS, provided that the Smith normal form of is , where is an odd and square-free integer and the number of 's…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Graph Labeling and Dimension Problems · Graph Theory and Algorithms
