| 完全k部图和一些特殊图的CORDIAL性 |
| |
| 引用本文： | 堵根民.完全k部图和一些特殊图的CORDIAL性[J].内蒙古师范大学学报(自然科学版),1997(2):9-12. |
| |
| 作者姓名： | 堵根民 |
| |
| 作者单位： | 呼和浩特市教育学院!呼和浩特，010051 |
| |
| 摘 要： | 给出了完全ｋ部图是Ｃｏｒｄｉａｌ图的充要条件，并给出此类Ｃｏｒｄｉａｌ图的Ｃｏｒｄｉａｌ标号，给出ｎ阶Ｃｏｒｄｉａｌ图的最大边数，并构造了相应的极图；给出正则图是Ｃｏｒｄｉａｌ图的必要条件；解决了轮的Ｃｏｒｄｉａｌ问题。
|
| 关 键 词： | Cordial图 完全k部图 正则图 极图 轮 |
ON THE CORDIALITY OF COMPLETE k-PARTITE GRAPH AND SOME SPECIFIC GRAPHS |
| |
| Du Genmin.ON THE CORDIALITY OF COMPLETE k-PARTITE GRAPH AND SOME SPECIFIC GRAPHS[J].Journal of Inner Mongolia Normal University(Natural Science Edition),1997(2):9-12. |
| |
| Authors: | Du Genmin |
| |
| Abstract: | The problems about cordial labeling of complete k - partite graph and wheel are settled in this paper. The maximal number of edges in cordial graph of n order is given. We also show a necessary condition for a k - reguler graph is cordial. |
| |
| Keywords: | Cordial graph complete k-partite graph regular graph extremal graph wheel |
| 本文献已被 CNKI 维普 等数据库收录！ |
