| 有交双圈图邻接矩阵的奇异性 |
| |
| 引用本文： | 谢小花,陈宝兴,陈宇.有交双圈图邻接矩阵的奇异性[J].漳州师范学院学报,2007,20(2):6-10. |
| |
| 作者姓名： | 谢小花 陈宝兴 陈宇 |
| |
| 作者单位： | 福建省漳州师范学院数学系 福建漳州363000(谢小花)，福建省漳州师范学院计算机科学系 福建漳州363000(陈宝兴，陈宇) |
| |
| 基金项目： | 福建省科技三项费资助项目 |
| |
| 摘 要： | 含有n个顶点,n 1条边的简单连通图称为双圈图.若双圈图G中存在两个圈,它们有公共交点,则称G是有交双圈图.本文给出了有交双圈图的邻接矩阵是奇异的充分必要条件.
|
| 关 键 词： | 有交双圈图 完美匹配 邻接矩阵 奇异性 |
| 文章编号： | 1008-7826（2007）02-0006-05 |
| 收稿时间： | 2006-07-29 |
| 修稿时间： | 2006-07-29 |
The Singularity of the Adjacency Matrix of an Interactive Bicycle Graph |
| |
| XIE Xiao-hua,CHEN Bao-xing,CHEN Yu.The Singularity of the Adjacency Matrix of an Interactive Bicycle Graph[J].Journal of ZhangZhou Teachers College(Natural Science),2007,20(2):6-10. |
| |
| Authors: | XIE Xiao-hua CHEN Bao-xing CHEN Yu |
| |
| Institution: | 1. Deptartment of Mathematics, Zhangzhou Normal University, Zhangzhou, Fujian 363000, China; 2. Deptartment of Computer Science, Zhangzhou Normal University, Zhangzhou, Fujian 363000, China |
| |
| Abstract: | A simple connected graph is called a bicycle graph if it has n vertices and n 1 edges. A bicycle graph G is called an interactive bicycle graph if there exist two cycles in G which have common vertices. The sufficient and necessary conditions for the adjacency matrix of an interactive bicycle graph to be singular are given in this paper. |
| |
| Keywords: | interactive bicycle graphs adjacency matrix perfect matching singularity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
