| 一组Nordhaus-Gaddum型定理 |
| |
| 引用本文： | 王志坚.一组Nordhaus-Gaddum型定理[J].苏州科技学院学报(自然科学版),1994(2). |
| |
| 作者姓名： | 王志坚 |
| |
| 摘 要： | 分别以Ｘ（Ｇ）、Ｘ１（Ｇ）、Ｘ２（Ｇ）记图Ｇ之色数、边色数和全色数，对任意ｐ阶简单图Ｇ及其补图Ｇ，本文得到以下Ｎｏｒｄｈａｕｓ-Ｇａｄｄｕｍ型结论：本文还指出，上面所有下界、上界对每个正整数ｐ均可达到。
|
| 关 键 词： | 图，补图，Nordhaus-Gaddum（型）定理，色数，边色数，全色数 |
Some theorems of the Nordhaus-Gaddum class |
| |
| Wang Zhijian.Some theorems of the Nordhaus-Gaddum class[J].Journal of University of Science and Technology of Suzhou,1994(2). |
| |
| Authors: | Wang Zhijian |
| |
| Institution: | Department of Mathematics |
| |
| Abstract: | Let the chromatic number of G,the edge chromatic number of G and the total chromatic number of G be denoted by X(G),X1 (G) and X2(G),respectively.For any simple graph G of order p and its complement G,the following inequalities of the NordhausGaddum class are obtained:whereand x] denotes the ceiling of x.We also show that these bounds are sharp for every positiveinteger p. |
| |
| Keywords: | graph complementary graph theorem of the Nordhaus-Gaddum class chromatic number edge chromatic number total chromatic number |
| 本文献已被 CNKI 等数据库收录！ |
