摘要
含有n个顶点,n+1条边的简单连通图称为双圈图.若双圈图G中存在两个圈,它们有公共交点,则称G是有交双圈图.本文给出了有交双圈图的邻接矩阵是奇异的充分必要条件.
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.
出处
《漳州师范学院学报（自然科学版）》
2007年第2期6-10,共5页
Journal of ZhangZhou Teachers College（Natural Science)
基金
福建省科技三项经费资助项目(2006F5068)
关键词
有交双圈图
完美匹配
邻接矩阵
奇异性
interactive bicycle graphs
adjacency matrix
perfect matching
singularity
