Computational Chemistry and Molecular Modeling
Atomic, Molecular and Optical Physics
Wiley InterScience Backfile Collection 1832-2000
Chemistry and Pharmacology
General structures represented by graphs with unequal interactions (weighted edges) are considered and their characteristic polynomials (spectral polynomials) are obtained. It is shown that the procedure based on pruning terminal vertices previously developed by one of the present authors (K.B., Ref. 1) can be generalized to more common graphs in which nonuniform interactions (unequal couplings) occur. Special cases of the present approach are Möbius graphs, signed graphs, directed graphs, multigraphs, and pseudographs (i.e., graphs with multiple connections and graphs with loops, respectively). Weighted graphs (with general weights) are applicable to a variety of chemical problems such as problems of chemical kinetics, analysis of NMR spectra, the study of simple molecular orbitals, and molecular vibrations.
Type of Medium: