On the chromatic roots of generalized theta graphs

Details On the chromatic roots of generalized theta graphs On the chromatic roots of generalized theta graphs

2000-12-05

arxiv.org/abs/math/0012033v1

J. Combin. Theory B 83, 272-297 (2001)

Mathematics

Combinatorics

LaTex2e, 25 pages including 2 figures

Scientific paper

The generalized theta graph \Theta_{s_1,...,s_k} consists of a pair of endvertices joined by k internally disjoint paths of lengths s_1,...,s_k \ge 1. We prove that the roots of the chromatic polynomial $pi(\Theta_{s_1,...,s_k},z) of a k-ary generalized theta graph all lie in the disc |z-1| \le [1 + o(1)] k/\log k, uniformly in the path lengths s_i. Moreover, we prove that \Theta_{2,...,2} \simeq K_{2,k} indeed has a chromatic root of modulus [1 + o(1)] k/\log k. Finally, for k \le 8 we prove that the generalized theta graph with a chromatic root that maximizes |z-1| is the one with all path lengths equal to 2; we conjecture that this holds for all k.

Affiliated with

Also associated with

No associations

Rating

On the chromatic roots of generalized theta graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the chromatic roots of generalized theta graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the chromatic roots of generalized theta graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-633263