Hostname: page-component-77c89778f8-5wvtr Total loading time: 0 Render date: 2024-07-25T03:43:29.603Z Has data issue: false hasContentIssue false
  • English
  • Français

Cayley's theorem and a method for approximating e

Published online by Cambridge University Press:  01 August 2016

Nick MacKinnon
Nick MacKinnon*
Affiliation:
Winchester College
Get access Rights & Permissions [Opens in a new window]

Extract

A tree is a network of vertices connected by edges such that the removal of any edge disconnects the network. In the language of graph theory a tree is a connected simple graph in which every edge is a bridge. Here are all the trees with 4 vertices.

Type
Research Article
Information
The Mathematical Gazette , Volume 72 , Issue 462 , December 1988 , pp. 293 - 297
Copyright
Copyright © The Mathematical Association 1988

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

References

1. Wilson, Robin J., Introduction to graph theory (3rd edition), Longman.Google Scholar
2. Grimaldi, Ralph P., Discrete and combinatorial mathematics, Addison Wesley.Google Scholar
3. Gardner, Martin, Further mathematical diversions, Pelican.Google Scholar
4. Cadwell, J.H., Topics in recreational mathematics, C.U.P. Google Scholar