Note on graphs with irreducible characteristic polynomials

DOI10.1016/J.LAA.2021.07.013MaRDI QIDQ1979360zbMATH OpenOpenAlexFDO

Authors Qian Yu, Fenjin Liu, Hao Zhang, Ziling Heng

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

zbMATH Keywords

coronacharacteristic polynomialirreducibilityfield extensionEisentein's criterion

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph polynomials (05C31) Algebraic field extensions (12F05)

Recommendations

• Irreducible graphs
• The characteristic polynomials of symmetric graphs
• scientific article; zbMATH DE number 125495
• scientific article; zbMATH DE number 3952816
• scientific article; zbMATH DE number 2130890

Cites work

• scientific article; zbMATH DE number 3739586 (Why is no real title available?)
• scientific article; zbMATH DE number 3505005 (Why is no real title available?)
• An introduction to the theory of graph spectra
• Controllable subsets in graphs
• Eigenvalues and automorphisms of a graph
• Further results on controllable graphs
• On a Conjecture of Godsil Concerning Controllable Random Graphs
• On an Irreducibility Theorem of A. Cohn
• Polynomials. Translated from the second Russian edition by Dimitry Leites.
• Prime Numbers and Irreducible Polynomials
• Some results on the spectral reconstruction problem
• Spectral conditions for the reconstructibility of a graph
• The characteristic polynomial of a random matrix

Cited in

(2)

• An upper bound for the height of a tree with a given eigenvalue
• scientific article; zbMATH DE number 3952816 (Why is no real title available?)

This page was built for publication: Note on graphs with irreducible characteristic polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1979360)