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

有向圈的行列式算法及HAMILTON图条件
引用本文:徐兵,贾仁安.有向圈的行列式算法及HAMILTON图条件[J].数学的实践与认识,2002,32(4):643-650.
作者姓名:徐兵  贾仁安
作者单位:南昌大学系统工程研究所,江西,330047
基金项目:国家自然科学基金资助课题,南昌大学校基金资助课题 Z1 75 9
摘    要:本文引入有向路乘法、弧行列式等概念 ,讨论了弧行列式的性质 ,阐述了二种计算有向圈的行列式方法及有向图 D为 Hamilton图的充要条件 ,最后给出了计算实例

关 键 词:有向图的核  弧行列式  有向圈  Hamilton图
修稿时间:2001年10月16

Determinant Calculation of Directed Cycles and Condition for Hamilton Digraph
XU Bing,Jia Ren-an.Determinant Calculation of Directed Cycles and Condition for Hamilton Digraph[J].Mathematics in Practice and Theory,2002,32(4):643-650.
Authors:XU Bing  Jia Ren-an
Abstract:In this paper, several definitions are provided, such as the multiplication of directed path, arc determinant and so on. Some fundamental qualities of arc determinant are discussed and two determinant approaches to calculating the directed cycles of the digraph are expounded. One necessary and sufficient condition for a digraph to be a Hamilton digraph is put forward. Finally, a case is discussed.
Keywords:kernel of digraph  arc determinant  directed cycle  Hamilton graph
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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