Electronic Resource
New York, NY [u.a.]
:
Wiley-Blackwell
Journal of Computational Chemistry
11 (1990), S. 829-836
ISSN:
0192-8651
Keywords:
Computational Chemistry and Molecular Modeling
;
Biochemistry
Source:
Wiley InterScience Backfile Collection 1832-2000
Topics:
Chemistry and Pharmacology
,
Computer Science
Notes:
A computer program is developed to compute distance polynomials of graphs containing up to 200 vertices. The code also computes the eigenvalues and the eigenvectors of the distance matrix. It requires as input only the neighborhood information from which the program constructs the distance matrix. The eigenvalues and eigenvectors are computed using the Givens-Householder method while the characteristic polynomials of the distance matrix are constructed using the codes developed by the author before. The newly developed codes are tested out on many graphs containing large numbers of vertices. It is shown that some cyclic isospectral graphs are differentiated by their distance polynomials although distance polynomials themselves are in general not unique structural invariants.
Additional Material:
3 Ill.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1002/jcc.540110706
| Library |
Location |
Call Number |
Volume/Issue/Year |
Availability |
