Counting hypercubes in hypercubes

DOI10.1016/J.DISC.2005.10.036MaRDI QIDQ860462zbMATH OpenOpenAlexWikidataFDO

Authors Sandi Klavžar

Publication date 9 January 2007

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2005.10.036

zbMATH Keywords

binomial identitiesenumeration

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19)

Recommendations

• Counting disjoint hypercubes in Fibonacci cubes
• q-counting hypercubes in Lucas cubes
• The distinguishing number of the hypercube
• On a heterochromatic number for hypercubes
• On the achromatic number of hypercubes
• scientific article; zbMATH DE number 1127885
• The Number of "Magic" Squares, Cubes, and Hypercubes
• Counting polycubes without the dimensionality curse
• Counting Polycubes without the Dimensionality Curse
• On crossing numbers of hypercubes and cube connected cycles

Cites work

• Discrete Mathematics
• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 686998 (Why is no real title available?)
• scientific article; zbMATH DE number 1550912 (Why is no real title available?)
• scientific article; zbMATH DE number 872231 (Why is no real title available?)
• Hypercubes and Pascal's Triangle: A Tale of Two Proofs
• On representations of the braid group
• On Some Abstract Properties of Binomial Coefficients
• The cube polynomial and its derivatives: The case of median graphs
• Two relations for median graphs

Cited in

(9)

• Bounding the size of the subgraph induced by \(m\) vertices and extra edge-connectivity of hypercubes
• A Census of Small Latin Hypercubes
• scientific article; zbMATH DE number 17500 (Why is no real title available?)
• Component edge connectivity of hypercubes
• Some binomial identities arising from a partition of an \(n\)-dimensional cube
• Cube polynomial of Fibonacci and Lucas cubes
• Globally optimal sequencing of optimal reactive dispatch control adjustments to minimize operational losses in transmission systems by graph shortest path, parallel computing, and dynamic programming
• Maximal hypercubes in Fibonacci and Lucas cubes
• Hamming polynomials and their partial derivatives

This page was built for publication: Counting hypercubes in hypercubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q860462)