A parallel algorithm is developed for the f i t time based on Frame's method to compute the characteristic polynomials of chemical graphs. This algorithm can handle all types of graphs: ordinary, weighted, directed, and signed. Our algorithm takes only linear time in the CRCW PRAM model with O(n9) p
Method for construction of characteristic polynomials via graph linearization
โ Scribed by Kakali Datta; Asok K. Mukherjee
- Publisher
- John Wiley and Sons
- Year
- 1997
- Tongue
- English
- Weight
- 157 KB
- Volume
- 65
- Category
- Article
- ISSN
- 0020-7608
No coin nor oath required. For personal study only.
โฆ Synopsis
A new method for construction of characteristic polynomials CP of complicated graphs having arbitrary edge and vertex weights has been developed. The method first converts the graph into isospectral linear chains with weighted vertices and edges and then builds up the CP coefficients recursively. Two types of graphs have been ลฝ . used for illustration, viz., i graphs that can be linearized by symmetry factorization and ลฝ .
ii graphs without symmetry which are to be linearized by an algorithm involving walks ลฝ . of unit length. Both types have been illustrated, of which type i includes the Schlegel of fullerene fragment C and another large graph with many fused rings.
๐ SIMILAR VOLUMES
## 1. ๏ฉ๏ฎ๏ด๏ฒ๏ฏ๏ค๏ต๏ฃ๏ด๏ฉ๏ฏ๏ฎ Recently several studies (see e.g. references [1,2]) have been reported in which the solutions of both constant and time-varying systems are expressed in terms of Chebyshev polynomials. The first applications of orthogonal polynomials to differential equations with periodic coeff