Jin Sui-Geng. ENUMERATING ALL HAMILTONIAN CYCLES IN SOME GRAPHS BY USING THE GENERALIZED FIBONACCI SEQUENCE AND ITS PRODUCTION RULE[J]. Journal of Electronics & Information Technology, 1983, 5(3): 147-154.
Citation:
Jin Sui-Geng. ENUMERATING ALL HAMILTONIAN CYCLES IN SOME GRAPHS BY USING THE GENERALIZED FIBONACCI SEQUENCE AND ITS PRODUCTION RULE[J]. Journal of Electronics & Information Technology, 1983, 5(3): 147-154.
Jin Sui-Geng. ENUMERATING ALL HAMILTONIAN CYCLES IN SOME GRAPHS BY USING THE GENERALIZED FIBONACCI SEQUENCE AND ITS PRODUCTION RULE[J]. Journal of Electronics & Information Technology, 1983, 5(3): 147-154.
Citation:
Jin Sui-Geng. ENUMERATING ALL HAMILTONIAN CYCLES IN SOME GRAPHS BY USING THE GENERALIZED FIBONACCI SEQUENCE AND ITS PRODUCTION RULE[J]. Journal of Electronics & Information Technology, 1983, 5(3): 147-154.
In this paper the Fibonacci sequence is generalized at first. Then the algorithm which has been published in this Journal by the author and his colleague is developed. Both production and recursion formulas for describing the algorithm are obtained. Here the two formulas for enumerating all hamiltonian cycles in two kinds of maxi-mum planar graphs seem to be derived for the first time.
金绥更、江炳尧,电子学通讯,4(1982), 191.[2]F. Harary著,李慰萱译,图论,上海科技出版社,1980.[4]D. E. Knuth著,管纪文、苏运霖译,计算机程序设计技巧,国防工业出版社,1980.[8]S. L. Hakimi and E. F. Schmeichel, J. of Graph Theory, 3(1979),69.
DownLoad: