首页 | 本学科首页   官方微博 | 高级检索  
     检索      

关于单圈图与无交双圈图的邻接矩阵的行列式
引用本文:谢小花,陈宝兴,陈宇.关于单圈图与无交双圈图的邻接矩阵的行列式[J].数学研究,2007,40(3):332-337.
作者姓名:谢小花  陈宝兴  陈宇
作者单位:1. 福建省漳州师范学院数学系,漳州,363000
2. 福建省漳州师范学院计算机科学系,漳州,363000
基金项目:福建省自然科学基金;漳州师范学院科研经费资助
摘    要:研究图的邻接矩阵的行列式主要是为了研究图的零特征值的重数,而零特征值的重数在化学分子结构图的稳定性问题中有广泛的应用.本文给出了单圈图及无交双圈图的邻接矩阵的行列式分类.

关 键 词:单圈图  无交双圈图  完美匹配  邻接矩阵  行列式
修稿时间:2006-07-10

On the Determinant of the Adjacency Matrix of a Graph With One Cycle or Non-interactive Bicycle
Xie Xiaohua,Chen Baoxing,Chen Yu.On the Determinant of the Adjacency Matrix of a Graph With One Cycle or Non-interactive Bicycle[J].Journal of Mathematical Study,2007,40(3):332-337.
Authors:Xie Xiaohua  Chen Baoxing  Chen Yu
Abstract:In this paper we studies the determinant of the adjacency matrix of a graph especially the multiplicity of their zero eigenvalue, which is widely applied in the stability of the chemical molecules. The determinants of the adjacency matrices of a graph with one cycle and a graph with non-interactive bicycle are considered in this paper.
Keywords:graph with one cycle  graph with non-interactive bicycle  adjacency matrix  perfect matching  determinant
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号