A problem on algebraic graph theory

DOI10.1016/0012-365X(85)90067-6MaRDI QIDQ1062995zbMATH OpenOpenAlexFDO

Authors Feng Keqin

Publication date 1985

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(85)90067-6

zbMATH Keywords

insolvable polynomialminimal trees

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Review text

Two trees with ten vertices are presented. Both of them have characteristic polynomial insolvable by radicals. This result answers the seventh open problem in the book Spectra of Graphs (1982; Zbl 0458.05042), raised by \textit{D. M. Cvetkovic}, \textit{M. Doob} and \textit{H. Sachs}. In the paper The minimal graphs with characteristic polynomial insolvable by radicals [Kexue Tongbao, Foreign Lang. Ed. 30, 1299-1302 (1985)] the author presents two graphs of six vertices with the same property.

Recommendations

• On a Problem in Graph Theory
• scientific article; zbMATH DE number 3232670
• scientific article; zbMATH DE number 3238444
• scientific article; zbMATH DE number 4019093
• A Problem in Graph Theory
• scientific article; zbMATH DE number 3212735
• Problem in graph theory
• scientific article; zbMATH DE number 3465354
• scientific article; zbMATH DE number 1600999
• scientific article; zbMATH DE number 3887722

Cites work

• scientific article; zbMATH DE number 3445421 (Why is no real title available?)
• Some graphs with characteristic polynomials which are not solvable by radicals

Cited in

(1)

• scientific article; zbMATH DE number 3952816 (Why is no real title available?)

This page was built for publication: A problem on algebraic graph theory

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