Counting hypercubes in hypercubes
From MaRDI portal
Publication:860462
DOI10.1016/j.disc.2005.10.036zbMath1106.05007OpenAlexW2101789501WikidataQ56213621 ScholiaQ56213621MaRDI QIDQ860462
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
Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19)
Related Items (5)
Hamming polynomials and their partial derivatives ⋮ Bounding the size of the subgraph induced by \(m\) vertices and extra edge-connectivity of hypercubes ⋮ Cube polynomial of Fibonacci and Lucas cubes ⋮ Maximal hypercubes in Fibonacci and Lucas cubes ⋮ Component Edge Connectivity of Hypercubes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two relations for median graphs
- The cube polynomial and its derivatives: The case of median graphs
- On representations of the braid group
- On Some Abstract Properties of Binomial Coefficients
- Hypercubes and Pascal's Triangle: A Tale of Two Proofs
- Discrete Mathematics
This page was built for publication: Counting hypercubes in hypercubes