| 有限图的约化及其连通性 |
| |
| 引用本文： | 李红刚 鲜思东. 有限图的约化及其连通性[J]. 重庆邮电学院学报(自然科学版), 2005, 17(3): 376-378 |
| |
| 作者姓名： | 李红刚 鲜思东 |
| |
| 作者单位： | 重庆邮电学院 重庆400065(李红刚)，重庆邮电学院 重庆400065(鲜思东) |
| |
| 基金项目： | “离散数学”重点课题建设基金资助项目 |
| |
| 摘 要： | 通过复杂图的邻接矩阵的变换，给出了有限图的约化图的邻接矩阵的概念，并在此基础上证明了有限图与其约化图的连通性是一致的，同时给出了任意有限图连通性判定的约化算法。
|
| 关 键 词： | 约化图 邻接矩阵 约化算法 |
Reduced graph of finite graph and its connectivity |
| |
| LI Hong-gang,XIAN Si-dong. Reduced graph of finite graph and its connectivity[J]. Journal of Chongqing University of Posts and Telecommunications(Natural Sciences Edition), 2005, 17(3): 376-378 |
| |
| Authors: | LI Hong-gang XIAN Si-dong |
| |
| Abstract: | In this article the authors give a concept with reduced graphic adjancency matrix of finite graph through the transformation of complex graphic adjancent matrix, and prove that the connectivity between finite graph and its reduced graph is consistent on the basic of it.At the same time, the authors give a reductive algorithm of arbitrary finite graphic connective decision. |
| |
| Keywords: | reduced graph adjancency matrix reductive algorithm |
| 本文献已被 CNKI 维普 等数据库收录！ |
