|
|
|
| COMPUTER AIDED ANALYSIS OF HAMILTONIAN CYCLES IN MAXIMUM PLANAR GRAPHS |
| Jin Sui-geng Jiang Bing-yao |
| Shanghai Institute of Metallurgy; Academia Sinica |
|
|
|
|
Abstract A recursive algorithm for generating all hamiltonian cycles in maximum planar graphs of certain type has been proposed. For wagner graphs, the computed results may be represented by the following formula: M(p) =6+4(p-5), 5 ≤ p ≤ 20 where p is the order of the graph and M (p) is the total number of hamiltonian cycles. A theorem has been given and the correetness of the algorithm has been proved.
|
|
Received: 28 February 1981
|
|
|
|
|
|
|
1982, Vol. 4 
