Skip to main content

The combinatorics of algebraic graph theory in theoretical physics

Contributed Papers

Part of the Lecture Notes in Mathematics book series (LNM,volume 686)

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

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.V. Aho, J.E. Hopcroft and J.D. Ullman. The design and analysis of computer algorithms. (1974) Addison-Wesley.

    Google Scholar 

  2. D.W. Barron, ‘Recursive techniques in programming', 1969 Macdonald.

    Google Scholar 

  3. R.J. Baxter, ‘Potts model at the critical temperature', J. Phys. C 6 (1973) L445–8.

    CrossRef  Google Scholar 

  4. 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.

    CrossRef  MATH  Google Scholar 

  5. N.L. Biggs, Algebraic graph theory. (1974) Cambridge U.P.

    Google Scholar 

  6. N.L. Biggs and G.H.J. Meredith, ‘Approximations for chromatic polynomials', J. Comb. Theory B 20 (1976) 5–19.

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. G.D. Birkhoff, ‘A determinantal formula for the number of ways of colouring graphs', Ann. of Math. (2) 14 (1912) 42–6.

    CrossRef  MathSciNet  Google Scholar 

  8. C. Domb, ‘Self avoiding walks in Ising and Heisenberg models', J. Phys. C 3 (1970) 256–84.

    CrossRef  Google Scholar 

  9. C. Domb, ‘Configurational studies of the Potts models', J. Phys. A 7 (1974) 1335–48.

    CrossRef  Google Scholar 

  10. J. Edmonds, ‘Paths trees and flowers', Canad. J. Math. 17 (1965) 449–67.

    CrossRef  MathSciNet  MATH  Google Scholar 

  11. I.G. Enting, ‘Series expansions for the Potts model: high-field expansions', J. Phys. A 7 (1974) 1617–26.

    CrossRef  Google Scholar 

  12. I.G. Enting and R.J. Baxter, ‘A special series expansion technique for the square lattice', J. Phys. A 10 (1977) L117–9.

    CrossRef  Google Scholar 

  13. C.M. Fortuin and P.W. Kasteleyn, ‘On the random-cluster model, I, Introduction and relation to other models', Physica 57 (1972) 536–64.

    CrossRef  MathSciNet  Google Scholar 

  14. F. Harary (ed.), ‘Graph Theory and Theoretical Physics', (1967) Academic.

    Google Scholar 

  15. F. Harary and E.M. Palmer, ‘Graphical Enumeration', (1973) Academic.

    Google Scholar 

  16. E. Ising, ‘Beitrag zur Theorie des Ferromagnetismus', Z. Phys. 31 (1925) 253–8.

    CrossRef  Google Scholar 

  17. 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.

    Google Scholar 

  18. T. Kihara, Y. Midzuno and T. Shizume, ‘Statistics of two-dimensional lattices with many components', J. Phys. Soc. Jap. 9 (1954) 681–7.

    CrossRef  Google Scholar 

  19. D. Kim and I.G. Enting, ‘The limit of chromatic polynomials', J. Comb. Theory B (1978) to be published.

    Google Scholar 

  20. J.F. Nagle, ‘On ordering and identifying undirected linear graphs', J. Math. Phys. 7 (1966) 1588–92.

    CrossRef  MathSciNet  MATH  Google Scholar 

  21. J.F. Nagle, ‘A new subgraph expansion for obtaining colouring polynomials for graphs', J. Comb. Theory B 10 (1971) 42–59.

    CrossRef  MathSciNet  MATH  Google Scholar 

  22. T. de Neef and I.G. Enting, ‘Series expansions from the finite lattice method', J. Phys. A 10 (1977) 801–5.

    CrossRef  Google Scholar 

  23. R.B. Potts, ‘Some generalised order-disorder transformations', Proc. Camb. Phil. Soc. 48 (1952) 106–9.

    CrossRef  MathSciNet  MATH  Google Scholar 

  24. J.E. Sammet, ‘Roster of programming languages for 1974–5', C.A.C.M. 19 (1976) 655–69.

    MATH  Google Scholar 

  25. 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.

    CrossRef  MathSciNet  Google Scholar 

  26. 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.

    CrossRef  Google Scholar 

  27. 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.

    Google Scholar 

  28. W.T. Tutte, ‘On dichromatic polynomials', J. Comb. Theory 2 (1967) 301–20.

    CrossRef  MathSciNet  MATH  Google Scholar 

  29. H. Whitney, ‘The colouring of graphs', Ann. of Math. 33 (1932) 688–718.

    CrossRef  MathSciNet  MATH  Google Scholar 

  30. M. Wortis, ‘Linked cluster expansions', Chapter 3 of Phase Transitions and Critical Phenomena Vol. 3. (1974) eds. C. Domb and M.S. Green. Academic.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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