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 in Pascal for the generation of king and color polynomials of graphs. The king polynomial was defined by Motoyama and Hosoya and was shown to be useful in dimer statistics, enumeration of Kekulé structures, etc. We show that the king polynomial of a lattice is the same as the color polynomial of the associated dualist graph, where the color polynomial is defined here as the number of ways of coloring the vertices of a graph with one type of color (say, green) such that two adjacent vertices are not colored with the same color. Applications of these polynomials to exact finite method of lattice statistics are outlined.
Additional Material:
6 Ill.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1002/jcc.540060513
Permalink