| 连通图的一种简单判别法 |
| |
| 引用本文： | 杨军.连通图的一种简单判别法[J].江苏广播电视大学学报,2008,19(5):48-50. |
| |
| 作者姓名： | 杨军 |
| |
| 作者单位： | 江苏广播电视大学,江苏,南京,210036 |
| |
| 摘 要： | 利用代数方法，给出无向图为连通图的充分必要条件，进一步得到判别“0—1”正线对称矩阵可幺化的简便方法。
|
| 关 键 词： | 连通图 “0—1”正线对称矩阵 幺矩阵 简单判别法 |
Easy Distinguish Method for Connected Graph |
| |
| YANG Jun.Easy Distinguish Method for Connected Graph[J].Journal of Jiangsu Radio & Television University,2008,19(5):48-50. |
| |
| Authors: | YANG Jun |
| |
| Institution: | YANG Jun(Jiangsu Radio & TV University,Nanjing 210036,Jiangsu,China) |
| |
| Abstract: | By using an algebraic method,a necessary and sufficient condition of the connected graph with the non-digraph is given.Further,a simple distinguish method is obtained for distinguishing the 0-1symmetric matrix of the positive line as a one-matrix. |
| |
| Keywords: | connected graph 0-1symmetric matrix of positive line one-matrix easy distinguishing way |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
