The algorithm for generation of connected closed linear graphs for lattice - spin systems

• Autorzy: Musiał G.
• Języki publikacji: EN

Abstrakty

EN

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.

• Wydawca: Institute of Bioorganic Chemistry Scientific Publishers OWN, Polish Academy of Sciences
• Czasopismo: Computational Methods in Science and Technology
• Rocznik: 1998
• Tom: Vol. 4
• Strony: 75--78
• Opis fizyczny: Bibliogr. 7 poz., tab.

Twórcy

autor

Musiał G.

• Computational Physics Division, Institute of Physics, A. Mickiewicz University ul. Umultowska 85, 61-614 Poznań, Poland,