| 连通的顶点可迁图的色唯一性 |
| |
| 引用本文： | 刘儒英,李念祖.连通的顶点可迁图的色唯一性[J].应用数学,1991,4(2):50-53. |
| |
| 作者姓名： | 刘儒英 李念祖 |
| |
| 作者单位： | 青海师范大学 810008(刘儒英)，上海第二工业大学 200041(李念祖) |
| |
| 摘 要： | 本文给出从一个已知的顶点可迁的非色唯一图出发,构造无穷多个顶点可迁的非色唯一图的一种方法,据此给出若干类无穷多个连通的顶点可迁,但不是色唯一的图簇,从而进一步否定地回答了Chia在1]中提出的问题.
|
| 关 键 词： | 图 顶点可迁图 色唯一图 |
Chromatic Uniqueness of Connected Vertex-Transitive Graphs |
| |
| Liu Ruying.Chromatic Uniqueness of Connected Vertex-Transitive Graphs[J].Mathematica Applicata,1991,4(2):50-53. |
| |
| Authors: | Liu Ruying |
| |
| Institution: | Liu Ruying (Qinghai Normal University 810008) Li Nianzu (Shanghai Second Polytechnic University 200041) |
| |
| Abstract: | 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 Chia1] in the negative. |
| |
| Keywords: | Graph Vertex-transitive graph Chromatically unique graph |
| 本文献已被 CNKI 维普 等数据库收录！ |
