| 一类完全三部图的色等价图 |
| |
| 引用本文： | 张淑敏. 一类完全三部图的色等价图[J]. 甘肃联合大学学报(自然科学版), 2011, 25(4): 6-9,13 |
| |
| 作者姓名： | 张淑敏 |
| |
| 作者单位： | 青海师范大学数学与信息科学系,青海西宁,810008 |
| |
| 基金项目： | 国家自然科学基金(10761003) |
| |
| 摘 要： | 我们已经得到了一些和完全三部图Km,n,r具有相同色多项式的图的必要条件.利用这些性质,得到了图Km,n,n(where 1≤m≤n)的色等价类.特别地,本文也证明了Km,n,n(2≤m≤n)能够由它们的色多项式唯一确定.
|
| 关 键 词： | 完全三部图 色多项式 色唯一 |
Chromatic Equivalence Graphs of Complete Tripartite Graphs |
| |
| ZHANG Shu-min. Chromatic Equivalence Graphs of Complete Tripartite Graphs[J]. Journal of Gansu Lianhe University :Natural Sciences, 2011, 25(4): 6-9,13 |
| |
| Authors: | ZHANG Shu-min |
| |
| Affiliation: | ZHANG Shu-min(Department of Mathematics and Information Science,Qinghai Normal University,Xining 810008,China) |
| |
| Abstract: | Some necessary conditions on a graph which shares the same chromatic polynomial as that of a complete tripartite graph Km,n,r are developed.Using these,the chromatic equivalence classes for Km,n,n(where 1≤m≤n) were obtained.In particular,it is shown that Km,n,n(where 2≤m≤n) are uniquely determined by their chromatic polynomials. |
| |
| Keywords: | complete tripartite graphs chromatic polynomials chromatic uniqueness |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
