Atlas home ||
Conferences |
Abstracts |
about Atlas
25th Australasian Conference on Combinatorial Mathematics and Combinatorial Computing
December 4-8, 2000
University of Canterbury
Christchurch, New Zealand |
|
Organizers
Charles Semple, Mike Steel
View Abstracts
Conference Homepage |
Zeros of Adjoint Polynomials of Paths and Cycles
by
Kee L Teo
Inst. Fundamental Sc. (Maths), Massey University
Coauthors: Dong F.M (Massey University), Little C.H.C (Massey University), Hendy M.D. (Massey University)
The chromatic polynomial of a simple graph G with n > 0 vertices is a
polynomial \Sigmak=1n \alpha(G, k) (x)k of degree n, where
(x)k = x(x-1) ... (x-k+1) and \alpha(G, k) is real for all k.
The adjoint polynomial of G is defined to be
\Sigmak=1n \alpha([`G], k) \muk, where [`G] is the
complement of G. We find the zeros of the adjoint polynomials of paths and
cycles.
Date received: October 31, 2000
Copyright © 2000 by the author(s).
The author(s) of this document and the organizers of the conference
have granted their consent to include this abstract in
Atlas Conferences Inc.
Document # cafn-23.