论文信息 - On the join of graphs and chromatic uniqueness

On the join of graphs and chromatic uniqueness

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.

G. L. Chia

[1] Pablo M. Salzberg,et al. On the chromatic uniquenes of bipartite graphs , 1986, Discret. Math..

[2] Chong-Yun Chao,et al. On q-trees , 1986, J. Graph Theory.

[3] Shaoji Xu,et al. The chromaticity of wheels , 1984, Discret. Math..

[4] E. J. Farrell,et al. On chromatic coefficients , 1980, Discret. Math..

[5] G. L. Chia. The chromaticity of wheels with a missing spoke , 1990, Discret. Math..

[6] Chong-Keang Lim,et al. A class of self-complementary vertex-transitive digraphs , 1986, J. Graph Theory.

[7] Ronald C. Read. A note on the chromatic uniqueness of W10 , 1988, Discret. Math..

[8] G. L. Chia. A note on chromatic uniqueness of graphs , 1986 .

[9] Beatrice Loerinc,et al. Chromatic polynomaials for regular graphs and modified wheels , 1981, J. Comb. Theory, Ser. B.

[10] Lian-Chang Zhao,et al. Cutpoints and the chromatic polynomial , 1984, J. Graph Theory.

[11] Chong-Yun Chao,et al. Chromatically unique graphs , 1979, Discret. Math..

[12] Chung-Piaw Teo,et al. The chromaticity of complete bipartite graphs with at most one edge deleted , 1990, J. Graph Theory.

[13] Chong-Yun Chao,et al. On maximally saturated graphs , 1982, Discret. Math..

[14] R. Read. An introduction to chromatic polynomials , 1968 .

[15] Kee L. Teo,et al. The search for chromatically unique graphs , 1990, Graphs Comb..