login
Triangle read by rows: T(n,m) (0 <= m <= n) = size of smallest set of nodes whose removal from an n-dimensional hypercube leaves no subgraph isomorphic to an m-dimensional Fibonacci cube.
0

%I #11 Jan 05 2015 06:28:32

%S 1,2,1,4,2,2,8,4,4,2,16,8,8,5,4,32,16,16,10

%N Triangle read by rows: T(n,m) (0 <= m <= n) = size of smallest set of nodes whose removal from an n-dimensional hypercube leaves no subgraph isomorphic to an m-dimensional Fibonacci cube.

%H Petr Gregor, <a href="http://dx.doi.org/10.1016/j.disc.2004.09.017">Recursive fault-tolerance of Fibonacci cube in hypercubes</a>, Discrete Math. 306 (2006), no. 13, 1327-1341.

%e Triangle begins:

%e 1

%e 2 1

%e 4 2 2

%e 8 4 4 2

%e 16 8 8 5 4

%e 32 16 16 10 8-10 6

%e 64 32 32 21 16-20 12 8

%e ...

%K nonn,more,tabl

%O 0,2

%A _N. J. A. Sloane_, Dec 04 2011