摘要
给出了完全k部图是Cordial图的充要条件，并给出此类Cordial图的Cordial标号;给出n阶Cordial图的最大边数,关构造了相应的极图;给出正则图是Cordial图的必要条件;解决了轮的Cordial问题.
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.
出处
《内蒙古师范大学学报（自然科学汉文版）》
CAS
1997年第2期9-12,共4页
Journal of Inner Mongolia Normal University(Natural Science Edition)
关键词
CORDIAL图
完全k部图
正则图
极图
轮
Cordial graph,complete k-partite graph,regular graph,extremal graph,wheel
