On the chromatic roots of generalized theta graphs
Brown, Jason ; Hickman, Carl ; Sokal, Alan D. ; Wagner, David G.
arXiv, 0012033 / Harvested from arXiv
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.
Publié le : 2000-12-05
Classification:  Mathematics - Combinatorics,  Condensed Matter - Statistical Mechanics,  Mathematical Physics,  05C15 (Primary),  30C15, 82B20 (Secondary)
@article{0012033,
     author = {Brown, Jason and Hickman, Carl and Sokal, Alan D. and Wagner, David G.},
     title = {On the chromatic roots of generalized theta graphs},
     journal = {arXiv},
     volume = {2000},
     number = {0},
     year = {2000},
     language = {en},
     url = {http://dml.mathdoc.fr/item/0012033}
}
Brown, Jason; Hickman, Carl; Sokal, Alan D.; Wagner, David G. On the chromatic roots of generalized theta graphs. arXiv, Tome 2000 (2000) no. 0, . http://gdmltest.u-ga.fr/item/0012033/