Some graphs with characteristic polynomials which are not solvable by radicals.
Chris D. GodsilPublished in: J. Graph Theory (1982)
Keyphrases
- np complete
- np hard
- special case
- graph theory
- graph isomorphism
- graph representation
- spanning tree
- website
- pattern recognition
- directed graph
- graph matching
- data structure
- graph mining
- graph partitioning
- structured objects
- object recognition
- graph databases
- graph clustering
- series parallel
- labeled graphs
- information systems