METHOD FOR CONSTRUCTION OF CHARACTERISTIC-POLYNOMIALS VIA GRAPH LINEARIZATION

A new method for construction of characteristic polynomials (CP) of co mplicated graphs having arbitrary edge and vertex weights has been dev eloped. The method first converts the graph into isospectral linear ch ains with weighted vertices and edges and then builds up the CP coeffi cients recursively. Two types of graphs have been used for illustratio n, viz., (i) graphs that can be linearized by symmetry factorization a nd (ii) graphs without symmetry which are to be Linearized by an algor ithm involving walks of unit length. Both types have been illustrated, of which type (i) includes the Schlegel of fullerene fragment C-20 an d another large graph with many fused rings. (C) 1997 John Wiley & Son s, Inc.