Symmetric vertex partitions of hypercubes by isometric trees

DOI10.1016/0095-8956(92)90055-3zbMath0701.05043OpenAlexW2004046347MaRDI QIDQ913820

Mark Ramras

Publication date: 1991

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(92)90055-3

zbMATH Keywords

hypercubeautomorphism groupisometric embeddingHamming codevertex partitionantipodal pathn- starperfect single-error-correcting codestree \({\mathcal T}\)

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Packing the hypercube

Cites Work

• Symmetric edge-decompositions of hypercubes
• Error Detecting and Error Correcting Codes
• On the decomposition of n‐cubes into isomorphic trees
• Unnamed Item
• Unnamed Item

This page was built for publication: Symmetric vertex partitions of hypercubes by isometric trees