Abstract
For many years physicists have been using graphs to represent the combinatorial properties of complicated algebraic expressions by defining sets of graphs whose generating functions are the physical quantities under investigation. In statistical mechanics there has recently been a trend towards the use of transformations which reduce the complexity of the graphical enumeration at the expense of an increase in algebraic complexity. A combinatorial analysis of algorithms used in actual computations shows why such a ‘trade-off’ is desirable. Series expansions for the limit of chromatic polynomials and for lattice models in statistical mechanics are considered as examples.
Keywords
- Series Expansion
- Ising Model
- Recursive Definition
- Tutte Polynomial
- Chromatic Polynomial
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
A.V. Aho, J.E. Hopcroft and J.D. Ullman. The design and analysis of computer algorithms. (1974) Addison-Wesley.
D.W. Barron, ‘Recursive techniques in programming', 1969 Macdonald.
R.J. Baxter, ‘Potts model at the critical temperature', J. Phys. C 6 (1973) L445–8.
R.J. Baxter, S.B. Kelland and F.Y. Wu, ‘Equivalence of the Potts model or Whitney polynomial with an ice-type model', J. Phys. A 9 (1976) 397–406.
N.L. Biggs, Algebraic graph theory. (1974) Cambridge U.P.
N.L. Biggs and G.H.J. Meredith, ‘Approximations for chromatic polynomials', J. Comb. Theory B 20 (1976) 5–19.
G.D. Birkhoff, ‘A determinantal formula for the number of ways of colouring graphs', Ann. of Math. (2) 14 (1912) 42–6.
C. Domb, ‘Self avoiding walks in Ising and Heisenberg models', J. Phys. C 3 (1970) 256–84.
C. Domb, ‘Configurational studies of the Potts models', J. Phys. A 7 (1974) 1335–48.
J. Edmonds, ‘Paths trees and flowers', Canad. J. Math. 17 (1965) 449–67.
I.G. Enting, ‘Series expansions for the Potts model: high-field expansions', J. Phys. A 7 (1974) 1617–26.
I.G. Enting and R.J. Baxter, ‘A special series expansion technique for the square lattice', J. Phys. A 10 (1977) L117–9.
C.M. Fortuin and P.W. Kasteleyn, ‘On the random-cluster model, I, Introduction and relation to other models', Physica 57 (1972) 536–64.
F. Harary (ed.), ‘Graph Theory and Theoretical Physics', (1967) Academic.
F. Harary and E.M. Palmer, ‘Graphical Enumeration', (1973) Academic.
E. Ising, ‘Beitrag zur Theorie des Ferromagnetismus', Z. Phys. 31 (1925) 253–8.
R.M. Karp, ‘The fast approximate solutions of hard combinatorial problems', Proceedings of the sixth Southeastern conference on combinatorics, graph theory and computing. (1975) 15–21 Utilitas Mathematica Publishing.
T. Kihara, Y. Midzuno and T. Shizume, ‘Statistics of two-dimensional lattices with many components', J. Phys. Soc. Jap. 9 (1954) 681–7.
D. Kim and I.G. Enting, ‘The limit of chromatic polynomials', J. Comb. Theory B (1978) to be published.
J.F. Nagle, ‘On ordering and identifying undirected linear graphs', J. Math. Phys. 7 (1966) 1588–92.
J.F. Nagle, ‘A new subgraph expansion for obtaining colouring polynomials for graphs', J. Comb. Theory B 10 (1971) 42–59.
T. de Neef and I.G. Enting, ‘Series expansions from the finite lattice method', J. Phys. A 10 (1977) 801–5.
R.B. Potts, ‘Some generalised order-disorder transformations', Proc. Camb. Phil. Soc. 48 (1952) 106–9.
J.E. Sammet, ‘Roster of programming languages for 1974–5', C.A.C.M. 19 (1976) 655–69.
M.F. Sykes, J.W. Essam and D.S. Gaunt, ‘Derivation of low-temperature expansions for the Ising model of a ferromagnet and an antiferromagnet', J. Math. Phys. 6 (1965) 283–298.
M.F. Sykes, D.S. McKenzie, M.G. Watts and J.L. Martin, ‘The number of self-avoiding rings on a lattice', J. Phys. A 5 (1972) 661–6.
H.N.V. Temperley, ‘Transformation of graph-theoretical problems into one another', Proceedings of the fifth British Combinatorial Conference 1975. 585–9. Utilitas Mathematica Publishing.
W.T. Tutte, ‘On dichromatic polynomials', J. Comb. Theory 2 (1967) 301–20.
H. Whitney, ‘The colouring of graphs', Ann. of Math. 33 (1932) 688–718.
M. Wortis, ‘Linked cluster expansions', Chapter 3 of Phase Transitions and Critical Phenomena Vol. 3. (1974) eds. C. Domb and M.S. Green. Academic.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1978 Springer-Verlag
About this paper
Cite this paper
Enting, I.G. (1978). The combinatorics of algebraic graph theory in theoretical physics. In: Holton, D.A., Seberry, J. (eds) Combinatorial Mathematics. Lecture Notes in Mathematics, vol 686. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0062527
Download citation
DOI: https://doi.org/10.1007/BFb0062527
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08953-7
Online ISBN: 978-3-540-35702-5
eBook Packages: Springer Book Archive
