Some graphs with characteristic polynomials which are not solvable by radicals

DOI10.1002/jgt.3190060216zbMath0449.05044OpenAlexW2005797538WikidataQ126254381 ScholiaQ126254381MaRDI QIDQ3895503

Chris D. Godsil

Publication date: 1982

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190060216

zbMATH Keywords

characteristic polynomialadjacency matrixmatchingshermite polynomials

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

Related Items (2)

On the Expressive Power of Query Languages for Matrices ⋮ A problem on algebraic graph theory

This page was built for publication: Some graphs with characteristic polynomials which are not solvable by radicals