Generalized spectral characterization of mixed graphs
Wei Wang, Lihong Qiu, Jianguo Qian, Wei Wang

TL;DR
This paper develops a spectral characterization for self-converse mixed graphs, establishing conditions under which such graphs are uniquely determined by their spectra, extending previous results to a broader class of graphs.
Contribution
It introduces a new spectral criterion involving Gaussian integers that ensures self-converse mixed graphs are uniquely identified by their spectra.
Findings
Spectral conditions guarantee graph isomorphism for certain self-converse mixed graphs.
Extension of previous spectral characterization results to mixed graphs.
Provides a framework involving Gaussian rational unitaries for graph determination.
Abstract
A mixed graph is a graph obtained from a simple undirected graph by orientating a subset of edges. is self-converse if it is isomorphic to the graph obtained from by reversing each directed edge. For two mixed graphs and with Hermitian adjacency matrices and , we say is \emph{-cospectral} to if, for any , and have the same spectrum, where is the all-one matrix. A self-converse mixed graph is said to be determined by its generalized spectrum, if any self-converse mixed graph that is -cospectral with is isomorphic to . Let be a self-converse mixed graph of order such that (which is always a real or pure imaginary Gaussian integer) is square-free in , where , and is the all-one vector. We…
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 · Matrix Theory and Algorithms · Synthesis and Properties of Aromatic Compounds
