基于邻接矩阵判断图的Cordial性OA
Judgment of the Cordiality of Graphs Based on Adjacent Matrix
给出了图G是Cordial图的充分必要条件；对于给定任意n阶图，给出如何利用计算机判断其Cordial性；利用计算机，给出找出所有n阶可Cordial图的方法。
The necessary and sufficient condition for Graph G to be cordial graph is given in this paper. The ways to judge the cordiality of any n-order graph and find out all n-order cordial graphs with a computer are al⁃so given in the paper.
卞洪亚
厦门工学院 理学院，福建 厦门 361021
数理科学
Cordial图邻接矩阵简单图
cordial graphadjacent matrixsimple graph
《常熟理工学院学报》 2016 (2)
96-99,4
评论