Computer generation of connected graphs

Published: 1 January 1974| Version 1 | DOI: 10.17632/cmvspvbmfv.1
D.C. Rapaport


Title of program: GRAFFITI Catalogue Id: ACOA_v1_0 Nature of problem The most successful technique currently used in studying the behaviour of magnetic spin models (e.g. the Ising model) near their phase transitions is the series expansion method. Generation of the coefficients of these expansions requires the availability of a list of suitable graphs, the type of graph required depending on the quantity being expanded. The computer program described here generates the connected graphs used in a study of the Ising model with impurities. Graphs required for other ... Versions of this program held in the CPC repository in Mendeley Data ACOA_v1_0; GRAFFITI; 10.1016/0010-4655(74)90021-6 This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2019)



Computational Physics, Computational Method