| A Counting Theorm for Hamilton Cyclic Number of a Given Graph |
| Received:October 21, 1983 |
| Key Words:
|
| Fund Project: |
|
| Hits: 1788 |
| Download times: 874 |
| Abstract: |
| In this paper, we derive a formula for counting the number of Hamilton cycles in a given graph G. Let e(G) be the number of the edges in G. Using this formuld, we obtain easily the number of Hamilton cycles in G if e(G)>e (G)and e(G)is small. |
| Citation: |
| DOI:10.3770/j.issn:1000-341X.1986.01.045 |
| View Full Text View/Add Comment |
