Systematic generation of linear graphs— Check and extension of the list of Uhlenbeck and Ford
| Autor: | P. Kasperkovitz, C. Foidl |
|---|---|
| Rok vydání: | 1990 |
| Předmět: |
Discrete mathematics
Numerical Analysis Physics and Astronomy (miscellaneous) Applied Mathematics Computer Science Applications Combinatorics Modular decomposition Computational Mathematics Indifference graph Pathwidth Chordal graph Modeling and Simulation Frequency partition of a graph Cograph Split graph Graph product Mathematics |
| Zdroj: | Journal of Computational Physics. 89:246-250 |
| ISSN: | 0021-9991 |
| DOI: | 10.1016/0021-9991(90)90125-k |
| Popis: | The problem of calculating the partition function of a system of p particles that interact via a pair potential requires the evaluation of a number of integrals each of which is in one-to-one correspondence with a linear graph with p points. The exact calculation of the partition function and the derivation of the resulting equation of state for clusters of hard particles was the motivation for developing an algorithm to generate a list of free graphs. Linear graphs may be represented in several ways; here it is done by assigning a number to each graph |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|