摘要
对于n阶Cordial图G,本文给出G的边数的上确界e*,并给出边数达到e*的Cordial图的构造.
For a Cordial graph with order n, we determine the sharp upper bound of their number of edges, the extremal graph is also constructed.
出处
《数学研究》
CSCD
2003年第4期437-439,共3页
Journal of Mathematical Study