The Fifth and Sixth Coefficients of the Characteristic Polynomial of a Graph
✍ Scribed by Patrícia Erthal de Moraes; Nair Maria Maia de Abreu; Samuel Jurkiewicz
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 281 KB
- Volume
- 11
- Category
- Article
- ISSN
- 1571-0653
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