马合木提江·阿克勒别克. 关于P3×Cn中哈密顿图的个数(英文)[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 2000, (2).DOI：
关于P3×Cn中哈密顿图的个数(英文)
摘要
设 Nm(n)表示卡氏积 Pm × Cn 中哈密顿圈的个数 .在本文中
我们得到了 N3 (n)的表达式 .
Abstract
Let N m(n) be the number of hamiltonian cycles in the cartesian product P m×C n
In this paper we derive the formula for N 3(n).
关键词
Keywords
references
Collins L,Krompart B.The Number of hamiltonian paths in a rectangular grid[J].Discrete Math,1997,16 9:2 9～ 38.
[2 ]Kwong YHH.Enumeration of hamiltonian cycles in P4 × Pnand P5× Pn[J].Ars Combinatoria,1992 ,33:87～ 96 .
Meng Jixiang.The hamiltonian decomposition and the number of hamiltonian cycles in the conjunction ofan indirected cycle and a directed cycle[J].Graph Theory Notes of New York:New York Academy ofSciences,1995,5:2 1～ 2 4 .
[4 ]Tosic R,Bodroza O,Kwong YHH,Straightt HJ.On the number of hamiltonian cycles of P4 × Pn [J].Indian Jof Pure and Appied Math,1990 ,2 1(5) :4 0 3～ 4 0 9.
L askar R.Decomposition of some composite graphs into hamiltonian cyles[A].Hungary:ColloquiaMathematica Societatis Janos Bolyai18,Combinatorics,Keszthely[C].1976
京公网安备11010802024621