二部完全图为H_2-cordial图的充分必要条件

Necessary and Sufficient Premise for Complete Bipartite Graph to be An H_2-cordial Graph

在图的Hp-cordial系列问题中,有关H-cordial的讨论较多,而图的H2-cordial性结果,目前仅涉及完全图与轮.为此,在引入二部完全图的边标号矩阵表示法后,给出了二部完全图是H2-cordial图的充分必要条件.

Among the achievements related to Hp-cordial problems, there is much discussion about H-cordial, but the results associated with H2-cordial properties of graphs seldom appear except for some involving complete graphs and wheels. In this paper, by introducing a matrix expression constructed by labeling edges of a complete bipartite graph, a necessary and sufficient premise for a complete bipartite graph to be an H2-cordial graph is given.