We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
The l 1 -Embeddability of Hypertrees and Unicyclic Hypergraphs.
- Authors
Wang, Guangfu; Chen, Lijun; Xiong, Zhikun
- Abstract
A hypercube is a graph whose nodes can be labeled by binary vectors such that the distance between the binary addresses in the graph is the Hamming distance. Due to the symmetry of the hypercube, one usually considers the graph embedded in the hypercube proportionally in distance, meaning that the l 1 -graphs. In this paper, we determine the l 1 -embeddability of hypertrees and unicyclic hypergraphs.
- Subjects
HYPERGRAPHS; HAMMING distance; GRAPH labelings
- Publication
Symmetry (20738994), 2022, Vol 14, Issue 11, p2260
- ISSN
2073-8994
- Publication type
Article
- DOI
10.3390/sym14112260