Note on graphs with irreducible characteristic polynomials
From MaRDI portal
Publication:1979360
DOI10.1016/j.laa.2021.07.013zbMath1479.05166OpenAlexW3184741431MaRDI QIDQ1979360
Ziling Heng, Fenjin Liu, Hao Zhang, Qian Yu
Publication date: 2 September 2021
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2021.07.013
Graph polynomials (05C31) Algebraic field extensions (12F05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spectral conditions for the reconstructibility of a graph
- Polynomials. Translated from the second Russian edition by Dimitry Leites.
- Controllable subsets in graphs
- The characteristic polynomial of a random matrix
- Some results on the spectral reconstruction problem
- Further results on controllable graphs
- On a Conjecture of Godsil Concerning Controllable Random Graphs
- Eigenvalues and automorphisms of a graph
- On an Irreducibility Theorem of A. Cohn
- Prime Numbers and Irreducible Polynomials
This page was built for publication: Note on graphs with irreducible characteristic polynomials
