The walk-matrix criterion for generalized spectral determination
The walk-matrix criterion for generalized spectral determination
Let be a self-converse mixed graph of order , with walk-matrix
Here denotes the self-converse mixed graphs of order , and is DGS when it is determined by its generalized Hermitian spectrum. Walk-matrix DGS conjecture. If and
is odd and square-free, then 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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.