摘要
用矩阵方法讨论了有向图的连通性 ,阐述了计算有向圈的矩阵方法及有向图为Hamilton图的充要条件 。
The connectedness of digraph is discussed by using matrix approach. The matrix approaches to calculate the directed cycles of the digraph are expounded. The necessary and sufficient conditions for a digraph to be a Hamilton graph are obtained. Finally,an example is presented.
出处
《南昌大学学报（理科版）》
CAS
北大核心
2002年第1期5-11,共7页
Journal of Nanchang University(Natural Science)
基金
国家自然科学基金资助项目 (7986 0 0 2 )
南昌大学校基金资助项目 (Z175 9)
