Skip to main content Accessibility help
×
Hostname: page-component-84b7d79bbc-x5cpj Total loading time: 0 Render date: 2024-08-03T16:15:42.123Z Has data issue: false hasContentIssue false

Appendix 1 - Some graph theory ideas

Published online by Cambridge University Press:  06 January 2010

Jaan Oitmaa
Affiliation:
University of New South Wales, Sydney
Chris Hamer
Affiliation:
University of New South Wales, Sydney
Weihong Zheng
Affiliation:
University of New South Wales, Sydney
Get access

Summary

This appendix provides a brief introduction to topics in the mathematical field of Graph Theory, which are pertinent to the subject of series expansions. For further details the reader is referred to Domb (1974) and to Chartrand (1977).

We start with some definitions.

  1. (i) A graph is a collection of points (vertices) and lines (bonds) (see Figure A1.1).

  2. (ii) A connected graph is one in which there is a path between any pair of points. A disconnected graph is one which is not connected. The number of components of a disconnected graph can be 2, 3, …

  3. (iii) An articulation point (articulation vertex) is a vertex, the removal of which, with all of its incident lines, breaks the connectivity of the graph.

  4. (iV) The order (degree) of a vertex is the number of lines incident on the vertex. Note that if a vertex is of order 1, then the vertex to which it is joined is an articulation vertex.

  5. (v) A star graph is a connected graph with no articulation points.

  6. (vi) A tree graph is a connected graph with at least one vertex of order 1 (Note that this differs from more usual definitions, but is most convenient for our purposes).

  7. (vii) Asimple graph is one in which there is at most one line joining any pair of vertices. A multi-graph is one in which there is more than one line between at least one pair of vertices.

  8. […]

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2006

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • Some graph theory ideas
  • Jaan Oitmaa, University of New South Wales, Sydney, Chris Hamer, University of New South Wales, Sydney, Weihong Zheng, University of New South Wales, Sydney
  • Book: Series Expansion Methods for Strongly Interacting Lattice Models
  • Online publication: 06 January 2010
  • Chapter DOI: https://doi.org/10.1017/CBO9780511584398.013
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • Some graph theory ideas
  • Jaan Oitmaa, University of New South Wales, Sydney, Chris Hamer, University of New South Wales, Sydney, Weihong Zheng, University of New South Wales, Sydney
  • Book: Series Expansion Methods for Strongly Interacting Lattice Models
  • Online publication: 06 January 2010
  • Chapter DOI: https://doi.org/10.1017/CBO9780511584398.013
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • Some graph theory ideas
  • Jaan Oitmaa, University of New South Wales, Sydney, Chris Hamer, University of New South Wales, Sydney, Weihong Zheng, University of New South Wales, Sydney
  • Book: Series Expansion Methods for Strongly Interacting Lattice Models
  • Online publication: 06 January 2010
  • Chapter DOI: https://doi.org/10.1017/CBO9780511584398.013
Available formats
×