摘要
给出L集合、L矩阵、连接积和通路矩阵的概念及基于这些概念的一些哈密顿回路的存在性判定定理和通过构造通路矩阵序列Mk=Mk－1*M（k=2，...，n）直接求出简单图（无向和有向）的全部哈密顿回路的算法及实例．
The present paper puts forward the concepts about L sets, L matrices, joining products and path matrices, and also gives out some theorems for judging the existence of the Hamiltonian circuit based on these concepts. We can directly obtain the soluting algorithm and instances of all Hamiltonian paths and circuits in a simple graph (or digrapt), by constructing the matricial sequence
出处
《吉林大学自然科学学报》
CSCD
1998年第2期5-8,共4页
Acta Scientiarum Naturalium Universitatis Jilinensis
关键词
哈密顿回路
存在性
判定
算法
Hamiltonian circuit, existence, judgementing, algorithm
