๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the characteristic polynomial of the adjacency matrix of the subdivision graph of a graph

โœ Scribed by Shoji Shinoda

Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
295 KB
Volume
2
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

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

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