GET_pdf delibra

Volume 4 (1) 1998, 75-78

THE ALGORITHM FOR GENERATION OF CONNECTED CLOSED LINEAR GRAPHS FOR LATTICE-SPIN SYSTEMS

Musiał Grzegorz

Computational Physics Division, Institute of Physics, A. Mickiewicz University
ul. Umultowska 85, 61-614 Poznań, Poland
e-mail: gmusial@pearl. amu. edu.pl

DOI:   10.12921/cmst.1998.04.01.75-78

OAI:   oai:lib.psnc.pl:494

Abstract:

The paper presents the algorithm and subroutine GRGEN for generation of connected closed linear graphs utilized in perturbation expansions. Starting with polygons and subsequently choosing pairs of not directly connected vertices in already generated graphs, the algorithm consequently projects one vertex onto the other one in the pair, generating only topologically different graphs. This algorithm is independent of the choice of a specific model and lattice geometry. The procedure is written in the FORTRAN 77 language, and is available at the Poznań Supercomputing and Networking Center on the SGI Power Challenge XL supercomputer.

References:

[1] C. Domb, in Phase Transitions and Critical Phenomena, ed. by C. Domb and M. S. Green,
Academic, New York 1974, Vol. 3, p. 1
[2] R. V. Ditzian et al., Phys. Rev., B22, 2542 (1980)
[3] J. J. Binney, N. J. Dowrick, A. J. Fisher, M. E. J. Newman, The theory of critical phenomena,
Clarendon Press, Oxford 1995 (Polish edition by PWN, Warszawa 1998), chapt. 3
[4] J. Nagle, Math. Phys., 7, 1588 (1966)