Displaying 1-3 of 3 results found.
page
1
Irregular triangle read by rows: T(n,k) is the number of inequivalent connected induced k-vertex subgraphs of the hypercube graph of dimension n >= 0, 1 <= k <= 2^n.
+10
4
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 3, 1, 1, 1, 1, 1, 3, 5, 11, 19, 36, 37, 41, 24, 18, 6, 4, 1, 1
Irregular triangle read by rows: T(n,k) is the number of connected induced k-vertex subgraphs, up to isomorphism, of the hypercube graph of dimension n >= 0, 1 <= k <= 2^n.
+10
4
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 3, 1, 1, 1, 1, 1, 3, 4, 9, 15, 31, 35, 40, 24, 18, 6, 4, 1, 1
Number of induced subgraphs, up to isomorphism, of the hypercube graph of dimension n.
+10
3
Search completed in 0.011 seconds
|