Is there a known formula for the number of closed walks of length (exactly) $r$ on the $n$-cube? If not, what are the best known upper and lower bounds?
[Edit] Note: the walk can repeat vertices.
|
3 | added 46 characters in body | ||
|
|
||||
|
|
2 | added 8 characters in body | ||
|
Is there a known formula for the number of closed walks of length (exactly) $r$ on the $n$-cube? If not, what are there the best known upper and lower bounds? |
||||
|
|
1 |
|
||
Number of closed walks on an $n$-cubeIs there a known formula for the number of closed walks of length (exactly) $r$ on the $n$-cube? If not, are there known upper and lower bounds?
|
||||
