Characteristic polynomials of chemical graphs via symmetric function theory
β Scribed by Richard Barakat
- Publisher
- Springer
- Year
- 1986
- Tongue
- English
- Weight
- 204 KB
- Volume
- 69
- Category
- Article
- ISSN
- 1432-2234
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A computer program based on the Frame method for the characteristic polynomials of graphs is developed. This program makes use of an efficient polynomial algorithm of Frame for generating the coefficients in the characteristic polynomials of graphs. This program requires as input only the set of ver
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
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. Tw