Computer generation of the characteristic polynomials of chemical graphs

✍ Scribed by K. Balasubramanian

• Publisher: John Wiley and Sons
• Year: 1984
• Tongue: English
• Weight: 497 KB
• Volume: 5
• Category: Article
• ISSN: 0192-8651
• DOI: 10.1002/jcc.540050417

✦ Synopsis

A computer program based on the Frame method for the characteristic polynomials of graphs is developed. This program makes use of an efficient polynomial algorithm of Frame for generating the coefficients in the characteristic polynomials of graphs. This program requires as input only the set of vertices that are neighbors of a given vertex and with labels smaller than the label of that vertex. The program generates and stores only the lower triangle of the adjacency matrix in canonical ordering in a one-dimensional array. The program is written in integer arithmetic, and it can be easily modified to real arithmetic. The coefficients in the characteristic polynomials of several graphs were generated in less than a few seconds, thus solving the difficult problem of generating characteristic polynomials of graphs. The characteristic polynomials of a number of very complicated graphs are obtained including for the first time the characteristic polynomial of an honeycomb lattice graph containing 54 vertices.