Computer generation of connected graphs

Main Author: CPC, Mendeley
Other Authors: Rapaport, D.C.
Format: Dataset
Terbitan: Mendeley , 1974
Subjects:
Online Access: https:/data.mendeley.com/datasets/cmvspvbmfv
ctrlnum 0.17632-cmvspvbmfv.1
fullrecord <?xml version="1.0"?> <dc><creator>CPC, Mendeley</creator><title>Computer generation of connected graphs </title><publisher>Mendeley</publisher><description>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)</description><subject>Computational Physics</subject><subject>Computational Method</subject><contributor>Rapaport, D.C.</contributor><type>Other:Dataset</type><identifier>10.17632/cmvspvbmfv.1</identifier><rights>Computer Physics Communications Journal Licence</rights><rights>https://www.elsevier.com/about/policies/open-access-licenses/elsevier-user-license/cpc-license/</rights><relation>https:/data.mendeley.com/datasets/cmvspvbmfv</relation><date>1974-01-01T12:00:00Z</date><recordID>0.17632-cmvspvbmfv.1</recordID></dc>
format Other:Dataset
Other
author CPC, Mendeley
author2 Rapaport, D.C.
title Computer generation of connected graphs
publisher Mendeley
publishDate 1974
topic Computational Physics
Computational Method
url https:/data.mendeley.com/datasets/cmvspvbmfv
contents 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)
id IOS7969.0.17632-cmvspvbmfv.1
institution Universitas Islam Indragiri
affiliation onesearch.perpusnas.go.id
institution_id 804
institution_type library:university
library
library Teknologi Pangan UNISI
library_id 2816
collection Artikel mulono
repository_id 7969
city INDRAGIRI HILIR
province RIAU
shared_to_ipusnas_str 1
repoId IOS7969
first_indexed 2020-04-08T08:30:11Z
last_indexed 2020-04-08T08:30:11Z
recordtype dc
_version_ 1686587755171151872
score 17.538404