基于邻接矩阵判断图的Cordial性  

Judgment of the Cordiality of Graphs Based on Adjacent Matrix

作　　者：卞洪亚 

机构地区：[1]厦门工学院理学院,福建厦门361021

出　　处：《常熟理工学院学报》2016年第2期96-99,共4页Journal of Changshu Institute of Technology

摘　　要：给出了图G是Cordial图的充分必要条件;对于给定任意n阶图,给出如何利用计算机判断其Cordial性;利用计算机,给出找出所有n阶可Cordial图的方法.The necessary and sufficient condition for Graph G to be cordial graph is given in this paper. Theways 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.

关 键 词：CORDIAL图 邻接矩阵 简单图 

分 类 号：O157.5[理学—数学]