Premium
On the join of graphs and chromatic uniqueness
Author(s) -
Chia G. L.
Publication year - 1995
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190190210
Subject(s) - combinatorics , mathematics , chromatic polynomial , vertex (graph theory) , discrete mathematics , graph , chromatic scale , join (topology) , transitive relation , chromaticity , computer science , artificial intelligence
A graph is chromatically unique if it is uniquely determined by its chromatic polynomial. Let G be a chromatically unique graph and let K m denote the complete graph on m vertices. This paper is mainly concerned with the chromaticity of K m + 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.