摘要
含有n个顶点,n+1条边的简单连通图称为双圈图.图的零度是指在图的谱中0特征值的重数.论文刻画了零度为1的所有相交双圈图的集合.
A simple connected graph is called a bicycle graph if it has n vertices and n＋l edges. The nullity of a graph G is defined to be the multiplicity of the eigenvalue zero in its spectrum. This paper characterizes all the intersected bicycle graphs with nullity one.
出处
《漳州师范学院学报（自然科学版）》
2012年第4期4-10,共7页
Journal of ZhangZhou Teachers College（Natural Science)
基金
福建省自然科学基金资助项目(2012D139)
关键词
邻接矩阵
图的谱
图的零度
相交双圈图
完美匹配
adjacency matrix
spectrum of graphs
nullity of graphs
intersected bicycle graphs
perfectmatching
