|
Search: id:A006865
|
|
|
| A006865 |
|
Number of Hamiltonian cycles in P_5 X P_{2n}: a(n) = 11a(n-1)+2a(n-3).
(Formerly M4946)
|
|
+0
1
|
|
| 1, 14, 154, 1696, 18684, 205832, 2267544, 24980352, 275195536, 3031685984, 33398506528, 367933962880, 4053336963648, 44653503613184, 491924407670784
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
F. Faase, On the number of specific spanning subgraphs of the graphs G X P_n, Ars Combin. 49 (1998), 129-154.
Kwong, Y. H. H.; Enumeration of Hamiltonian cycles in $P\sb 4\times P\sb n$ and $P\sb 5\times P\sb n$. Ars Combin. 33 (1992), 87-96.
Kwong, Y. H. H.; A Matrix Method for Counting Hamiltonian Cycles on Grid Graphs, European J. of Combinatorics 15 (1994), 277-283.
|
|
LINKS
|
F. Faase, On the number of specific spanning subgraphs of the graphs G X P_n, Preliminary version of paper that appeared in Ars Combin. 49 (1998), 129-154.
F. Faase, Counting Hamilton cycles in product graphs
F. Faase, Results from the counting program
F. Faase, Counting Hamilton cycles in product graphs
|
|
CROSSREFS
|
Sequence in context: A125426 A004986 A154248 this_sequence A154347 A001707 A078999
Adjacent sequences: A006862 A006863 A006864 this_sequence A006866 A006867 A006868
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), kwong(AT)cs.fredonia.edu (Harris Kwong), Frans Faase (Frans_LiXia(AT)wxs.nl)
|
|
|
Search completed in 0.002 seconds
|
