## 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
On the evaluation at (3, 3) of the Tutte polynomial of a graph
β Scribed by Michel Las Vergnas
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 277 KB
- Volume
- 45
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Two algorithms for the evaluation of the characteristic polynomial of a graph G are described. Both algorithms have the operation count of the order n3, where n is the number of the vertices in the graph G. These algorithms are stable, fast, and efficient. They are one order of magnitude faster tha
Several unique advantages of the Le Verrier-Fadeev-Frame method for the characteristic polynomials of graphs over the method proposed by Zivkovic recently based on the Givens-Householder method are described. It is shown that the Givens-Householder method proposed by Zivkovic, by itself fails for di
The Wiener index is a graphical invariant that has found extensive application in chemistry. We define a generating function, which we call the Wiener polynomial, whose derivative is a q-analog of the Wiener index. We study some of the elementary properties of this polynomial and compute it for some