连通的顶点可迁图的色唯一性  

Chromatic Uniqueness of Connected Vertex-Transitive Graphs

作　　者：刘儒英[1] 李念祖[2] 

机构地区：[1]青海师范大学,810008 [2]上海第二工业大学,200041

出　　处：《应用数学》1991年第2期50-53,共4页Mathematica Applicata

基　　金：国家自然科学基金

摘　　要：本文给出从一个已知的顶点可迁的非色唯一图出发,构造无穷多个顶点可迁的非色唯一图的一种方法,据此给出若干类无穷多个连通的顶点可迁,但不是色唯一的图簇,从而进一步否定地回答了Chia在[1]中提出的问题.In this paper is introduced a method of constructing an infinite number of connected vertex-transitive and not chromatically unique graphs based on one such known graph by which several families of the graphs are also given. This answers a problem of Chia[1] in the negative.

关 键 词：连通图 顶点可迁图 色唯一性 

分 类 号：O157.5[理学—数学]