Characteristic and matching polynomials of chemical graphs

Herndon, W. C. ; Radhakrishnan, T. P. ; Zivkovic, T. P. (1988) Characteristic and matching polynomials of chemical graphs Chemical Physics Letters, 152 (2-3). pp. 233-238. ISSN 0009-2614

Full text not available from this repository.

Official URL:

Related URL:


A new algorithm is described for the calculation of characteristic polynomials of graphs. This algorithm uses the Householder matrix tridiagonalization method in combination with the Sturm sequence to directly provide the desired polynomial coefficients. The accuracy of the procedure for moderately large chemical graphs (≈ 100 vertices) is shown to be equivalent to that of previous procedures which use integer arithmetic. A new non-recursive procedure for evaluation of the matching polynomial is also presented. This latter procedure uses a single multiple fragmentation of a polycyclic graph to obtain acyclic fragments whose characteristic polynomials define the matching polynomial.

Item Type:Article
Source:Copyright of this article belongs to Elsevier Science.
ID Code:72537
Deposited On:29 Nov 2011 04:09
Last Modified:29 Nov 2011 04:09

Repository Staff Only: item control page