Author:
Dong F. M.,Royle Gordon,Wagner Dave
Abstract
For any positive integers $a,b,c,d$, let $R_{a,b,c,d}$ be the graph obtained from the complete graphs $K_a, K_b, K_c$ and $K_d$ by adding edges joining every vertex in $K_a$ and $K_c$ to every vertex in $K_b$ and $K_d$. This paper shows that for arbitrary positive integers $a,b,c$ and $d$, every root of the chromatic polynomial of $R_{a,b,c,d}$ is either a real number or a non-real number with its real part equal to $(a+b+c+d-1)/2$.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献