The walk-matrix criterion for generalized spectral determination

Let GG be a self-converse mixed graph of order nn, with walk-matrix

W(G)=[e,Ae,A2e,,An1e].W(G)=[e,Ae,A^2e,\ldots,A^{n-1}e].

Here Gnsc\mathcal{G}_n^{sc} denotes the self-converse mixed graphs of order nn, and GG is DGS when it is determined by its generalized Hermitian spectrum. Walk-matrix DGS conjecture. If GGnscG\in\mathcal{G}_n^{sc} and

detW(G)2n/2\frac{|\det W(G)|}{2^{\lfloor n/2\rfloor}}

is odd and square-free, then GG is DGS. This conjectural criterion generalizes a known divisibility phenomenon for ordinary graph walk-matrices to self-converse mixed graphs; the paper presents it as a proposed generalization and develops equivalent formulations.

Sources & referencesView supporting material

Primary source

Wei Wang, Lihong Qiu, Jianguo Qian and Wei Wang, “Generalized spectral characterization of mixed graphs”, arXiv:1911.13004 (2019).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.