ZIB

Treffer pro Seite

Treffer 1 - 1 | 1 Treffer

Alles auswählen Exportieren

Digitale Medien

Computational algorithms for matching polynomials of graphs from the characteristic polynomials of edge-weighted graphs (1989)

Hosoya, Haruo ; Balasubramanian, K.

New York, NY [u.a.] : Wiley-Blackwell

Journal of Computational Chemistry 10 (1989), S. 698-710

zur Merkliste hinzufügen auf der Merkliste

Details

ISSN: 0192-8651

Schlagwort(e): Computational Chemistry and Molecular Modeling ; Biochemistry

Quelle: Wiley InterScience Backfile Collection 1832-2000

Thema: Chemie und Pharmazie , Informatik

Notizen: Computational algorithms are described which provide for constructing the set of associated edge-weighted directed graphs such that the average of the characteristic polynomials of the edge-weighted graphs gives the matching polynomial of the parent graph. The weights were chosen to be unities or purely imaginary numbers so that the adjacency matrix is hermitian. The computer code developed earlier by one of the authors (K.B.) is generalized for complex hermitian matrices. Applications to bridged and spirographs, some lattices and all polycyclic graphs containing up to four cycles are considered.

Zusätzliches Material: 5 Ill.

Materialart: Digitale Medien

URL: http://dx.doi.org/10.1002/jcc.540100511

Bibliothek	Standort	Signatur	Band/Heft/Jahr	Verfügbarkeit

Andere fanden auch interessant ...

Artikel (Nationallizenzen)

Volltext

Treffer 1 - 1 | 1 Treffer