完全解决图$overline{B_{n-8,1,4}}$的色等价类 |
| |
作者姓名: | 毛亚平 冶成福 张淑敏 |
| |
作者单位: | 青海师范大学数学系, 青海 西宁 810008;青海师范大学数学系, 青海 西宁 810008;青海师范大学数学系, 青海 西宁 810008 |
| |
基金项目: | 国家自然科学基金(Grant No.11161037), 青海省自然基金项目(Grant No.2011-z-907). |
| |
摘 要: | Two graphs are defined to be adjointly equivalent if and only if their complements are chromatically equivalent.Using the properties of the adjoint polynomials and the fourth character R4(G),the adjoint equivalence class of graph Bn-8,1,4 is determined.According to the relations between adjoint polynomial and chromatic polynomial,we also simultaneously determine the chromatic equivalence class of Bn-8,1,4 that is the complement of Bn-8,1,4.
|
关 键 词: | chromatic equivalence class adjoint polynomial the smallest real root the fourth character. |
收稿时间: | 2010-10-14 |
修稿时间: | 2011-01-13 |
本文献已被 CNKI 等数据库收录! |
| 点击此处可从《数学研究及应用》浏览原始摘要信息 |
|
点击此处可从《数学研究及应用》下载全文 |
|