ENUMERATING ALL HAMILTONIAN CYCLES IN SOME GRAPHS BY USING THE GENERALIZED FIBONACCI SEQUENCE AND IT

• 作 者: 金绥更
• 机 构: Shanghai Institute of Metallurgy Academia Sinica,
• 出 处: Journal of Electronics(China)
• 发表日期: 1984年02期
• 关键词: Hamiltonian Fibonacci describing triangular 气气 Wagner infinite listed formulas d

In this paper,the Fibonacci sequence is first generalized,and then the algorithm proposed by theauthor is developed.Both production and recursion formulas describing the algorithm are ob-tained.Then two expressions for enumerating all Hamiltonian cycles in the two kinds of maximumplanar graphs are derived for the first time.

In this paper, the Fibonacci sequence is first generalized, and then the algorithm proposed by theauthor is developed.Both production and recursion formulas describing the algorithm are ob-tained.Then two expressions for enumerating all Hamiltonian cycles in the two kinds of maximumplanar graphs are derived for the first time.