𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The characteristic polynomial of a chemical graph

✍ Scribed by Nenad Trinajstić

Publisher
Springer
Year
1988
Tongue
English
Weight
995 KB
Volume
2
Category
Article
ISSN
0259-9791

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the evaluation of the characteristic
On the evaluation of the characteristic polynomial of a chemical graph
✍ Tomislav P. Živković 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 583 KB

## 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

Evaluation of the characteristic polynom
Evaluation of the characteristic polynomial of a graph
✍ Tomislav P Z̆ivković 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 387 KB

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

Comments on the characteristic polynomia
Comments on the characteristic polynomial of a graph
✍ K. Balasubramanian 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 655 KB

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