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

双圈图的邻接矩阵的奇异性
引用本文:何梅芝.双圈图的邻接矩阵的奇异性[J].湖南城市学院学报(自然科学版),2006,15(3):40-43.
作者姓名:何梅芝
作者单位:湖南工学院,基础课部,湖南,衡阳,421008
摘    要:连通的双圈图(即边数比顶点数多一个的连通简单图)恰有3种类型,其中2种类型的图的邻接矩阵的奇异性问题业已解决.现给出第三种类型的双圈图的邻接矩阵是奇异的充要条件.

关 键 词:双圈图  邻接矩阵  行列式
文章编号:1672-7304(2006)03-0040-04
收稿时间:2006-03-10
修稿时间:2006-03-10

The Singular of the Adjacency Matrix of Graphs with Bicycle
HE Mei-zhi.The Singular of the Adjacency Matrix of Graphs with Bicycle[J].Journal of Hunan City University:Natural Science,2006,15(3):40-43.
Authors:HE Mei-zhi
Institution:Department of Fundamental Courses, Hunan Institute of Technology, Hengyang, Hunan 421008, China
Abstract:There are three types in the connected bicycle graphs(the number of the edges is the number of the points adding one).The singular of the adjacency matrix of two of them has been studied.The Iff conditions of the singular of the adjacency matrix of the third type of the bicycle graphs is determined in this article.
Keywords:Bicycle graphs  adjacency matrix  determinant
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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