Chemical graph theory. IV. On the cyclic polynomial
✍ Scribed by J. Seibert; N. Trinajstića
- Publisher
- John Wiley and Sons
- Year
- 1983
- Tongue
- English
- Weight
- 461 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0020-7608
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In the Ramsey theory of graphs F Ä (G, H) means that for every way of coloring the edges of F red and blue F will contain either a red G or a blue H. Arrowing, the problem of deciding whether F Ä (G, H), lies in 6 p 2 =coNP NP and it was shown to be coNP-hard by Burr [Bur90]. We prove that Arrowing
## Abstract The evaluation of the characteristic polynomial of a chemical graph is considered. It is shown that the operation count of the Le Verrier–Faddeev–Frame method, which is presently considered to be the most efficient method for the calculation of the characteristic polynomial, is of the o