Math Problem Statement
对于一个mn大小的棋盘,棋子从棋盘中的某个格子开始,每次向相邻的格子移动一步,若能不重复地遍历完棋盘中的所有格子,并且在遍历完成后能一步回到起点,则称这样的棋盘为哈密顿棋盘。例如44的棋盘是哈密顿棋盘,但3*3的棋盘则不是。\n\n请问在2到5的自然数中任挑选两个数字充当m和n,能组成多少种哈密顿棋盘?
Solution
Ask a new question for Free
By Image
Drop file here or Click Here to upload
Math Problem Analysis
Mathematical Concepts
Graph Theory
Hamiltonian Paths
Hamiltonian Cycles
Formulas
-
Theorems
-
Suitable Grade Level
Advanced Mathematics