Generalized spectral characterization of mixed graphs
From MaRDI portal
Publication:2223447
DOI10.37236/9588zbMath1472.05102arXiv1911.13004OpenAlexW3113616870MaRDI QIDQ2223447
Wei Wang, Wei Wang, Lihong Qiu, Jian Guo Qian
Publication date: 29 January 2021
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.13004
Related Items (3)
Spectral characterizations of tournaments ⋮ Proof of a conjecture on the determinant of the walk matrix of rooted product with a path ⋮ An improved condition for a graph to be determined by its generalized spectrum
Uses Software
Cites Work
- A simple arithmetic criterion for graphs being determined by their generalized spectra
- Generalized spectral characterization of graphs revisited
- Hermitian-adjacency matrices and Hermitian energies of mixed graphs
- Discriminants of polynomials related to Chebyshev polynomials: the ``Mutt and Jeff syndrome
- On the generalized spectral characterizations of Eulerian graphs
- An excluding algorithm for testing whether a family of graphs are determined by their generalized spectra
- Hermitian adjacency spectrum and switching equivalence of mixed graphs
- Developments on spectral characterizations of graphs
- A note on cospectral graphs
- Which graphs are determined by their spectrum?
- Mixed paths and cycles determined by their spectrum
- A new arithmetic criterion for graphs being determined by their generalized \(Q\)-spectrum
- A new method for constructing graphs determined by their generalized spectrum
- Practical graph isomorphism. II.
- Large regular bipartite graphs with median eigenvalue 1
- A sufficient condition for a family of graphs being determined by their generalized spectra
This page was built for publication: Generalized spectral characterization of mixed graphs
