A problem on algebraic graph theory (Q1062995)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A problem on algebraic graph theory |
scientific article; zbMATH DE number 3916294
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A problem on algebraic graph theory |
scientific article; zbMATH DE number 3916294 |
Statements
A problem on algebraic graph theory (English)
0 references
1985
0 references
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.
0 references
minimal trees
0 references
insolvable polynomial
0 references
0 references