Journal of Changshu Institute of Technology2016，Vol.30Issue(2)：96-99,4.
基于邻接矩阵判断图的Cordial性
Judgment of the Cordiality of Graphs Based on Adjacent Matrix
卞洪亚1
作者信息
- 1. 厦门工学院 理学院，福建 厦门 361021
- 折叠
摘要
Abstract
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.关键词
Cordial图/邻接矩阵/简单图Key words
cordial graph/adjacent matrix/simple graph分类
数理科学引用本文复制引用
卞洪亚..基于邻接矩阵判断图的Cordial性[J].Journal of Changshu Institute of Technology,2016,30(2):96-99,4.
