Centre for Discrete and Applicable Mathematics |
|
CDAM Research Report, LSE-CDAM-2000-07June 2000 |
Norman Biggs and Philipp Reinfeld
Abstract
The aim of this paper is to study the chromatic polynomials of a family of
cubic graphs Dn
with 4n vertices. In
particular D5 is the graph of the
regular dodecahedron.
We use the compatibility matrix method to obtain a third-order recursion
for the leading terms of the chromatic polynomial
of Dn, as well as information
about the remaining terms. Then we apply a theorem of Beraha, Kahane and
Weiss to describe the curves on which the limit points of the chromatic
roots lie.
In Section 6 we analyse a method of Salas and Sokal, in order to
provide a good description of the limit curves.
A compressed (gzip) PostScript file (101 kB) with the full contents of this report can be downloaded by clicking here.
Alternatively, if you like a free hard copy of this report, please send the number of this report, LSE-CDAM-2000-07, together with your name and postal address to:
CDAM Research Reports Series Centre for Discrete and Applicable Mathematics London School of Economics Houghton Street London WC2A 2AE, U.K. |
||
Phone: +44(0)-20-7955 7732. Fax: +44(0)-20-7955 6877. Email: info@maths.lse.ac.uk |
Introduction to the CDAM Research Report Series. | ||
CDAM Homepage. |
Last changed: Wed 9 Feb 2005
For comments go to:
http://www.maths.lse.ac.uk/webmaster.html.