摘要
G是双圈图,H是由G的独立边和不相交圈构成的生成子图.通过讨论G及导出子图的完美匹配数统计了H的个数与类型,获得了双圈图邻接矩阵的奇异性分类及其行列式的值分布;得到了所有双圈图邻接矩阵的最大行列式为16.
Let G be a graph with two cycles.H is spanning subgraph with only independent edges and un-intersectant cycles of G.The numbers and types of H are determinated by discussing the number of perfect matching of G and its induced subgraph.This paper investigates the value distribution of the determinant and the classification of the adjacency matrix of G.The maximum determinant of the adjacency matrix of graphs with two cycles is 16.
出处
《电子科技大学学报》
EI
CAS
CSCD
北大核心
2007年第S1期359-362,共4页
Journal of University of Electronic Science and Technology of China
关键词
邻接矩阵
分类
行列式
双圈图
完美匹配
adjacency matrix
classification
determinant
graph with two cycles
perfect matching
