In this paper we give a formula for enumerating the equivalent classes of orderly labeled Hamiltonian graphs under group D. and two algorithms for constructing these equivalent classes and all nonisomorphic Hamiltonia...In this paper we give a formula for enumerating the equivalent classes of orderly labeled Hamiltonian graphs under group D. and two algorithms for constructing these equivalent classes and all nonisomorphic Hamiltonian graphs. Some computational results obtained by microcomputers are listed.展开更多
基金Project supported by National Natural Foundation of China
文摘In this paper we give a formula for enumerating the equivalent classes of orderly labeled Hamiltonian graphs under group D. and two algorithms for constructing these equivalent classes and all nonisomorphic Hamiltonian graphs. Some computational results obtained by microcomputers are listed.
