On the join of graphs and chromatic uniqueness
Gek Ling Chia · Journal of Graph Theory · 1995
Abstract A graph is chromatically unique if it is uniquely determined by its chromatic polynomial. Let G be a chromatically unique graph and let Km denote the complete graph on m vertices. This paper is mainly concerned with the chromaticity of Km + G where + denotes the join of graphs. Also, it is shown that a large family of connected vertextransitive graphs that are not chromatically unique can be obtained by taking the join of some vertex‐transitive graphs. © 1995 John Wiley & Sons, Inc.